Abstract: This tutorial presents a broad overview of the major components of Multimedia Information Systems as well as in-depth view of several key principles and techniques used in the various components. We will discuss the following topics: nature of multimedia data (audio, images, and video); A/D conversion, quantization, processing; quantization; compression; JPEG standard; MPEG standard; storage structures of CD-ROMs, DVDs and RAIDs; file system support for continuous media; data placement and disk scheduling algorithms; object-oriented models; temporal models; spatial models; content-based queries, query processing, multidimensional index structures, similarity metrics and similarity searching; network support for multimedia; server-client interaction; quality of service; variable/adaptive bit rates; synchronization.

S. R. Subramanya received the doctoral degree in Computer Science from George Washington University, Washington, D.C. He is currently an Assistant Professor at the University of Missouri--Rolla. He has been teaching courses and conducting research in Multimedia Systems, Data Compression, and Computer Security.

Abstract: This tutorial consists of the following sections: introduction and motivation; classification of formal verification techniques; specification formalisms; modeling formalisms; binary decision diagrams and variants; verification techniques: (a) theorem Proving and (b) model checking; additional topics:(a) verification of sequential programs and (b) verification concurrent software, and (c) symbolic simulation; overview of some formal verification tools; overview of semi-formal verification; limitations of formal verification and the road ahead.

S. Ramesh has a B.E. from I. I. Sc. Bangalore, Ph.D. from IIT Bombay, and is currently a Professor in the Department of Computer Science & Engineering at IIT Bombay. He has held visiting positions at various universities abroad. His research interests are in programming languages, distributed computing, embedded and real time systems, verification and validation, and software engineering.

S. Chakraborty did his B. Tech. from IIT Kharagpur where he was awarded the President's Gold Medal. He did his M.S. and Ph.D. from Stanford University and is currently a faculty member with the Computer Science & Engineering Department of IIT Bombay. His research interests are in formal techniques for analysis, verification, and validation of digital systems.

Abstract: Security issues in computer networks is an important areas of research with the fantastic proliferation of Internet, and the emergence of sensitive applications like e-commerce. Hiding sensitive transactions from intruders as well as providing a reliable means for authenticating oneself are the most important areas of research. The tutorial will provide an overview of the security technologies that have been proposed, with particular focus on those which have been implemented in practice. Topics like conventional cryptography, public key cryptosystems and message digest would be covered, and so also will be emerging techniques like elliptic curve cryptography. Finally, the way security problems are currently dealt with in the Internet scenario would be discussed.

I. Sengupta has obtained his B. Tech., M. Tech, and Ph.D. from University of Calcutta. He is currently an Associate Professor in the Department of Computer Science & Engineering, IIT Kharagpur. His research interests include computer networks and security, VLSI design, fault tolerance and testability.

Abstract: This tutorial consists of the following sections: what is agent based programming paradigm; characteristics of an software agent; agent taxonomy – architecture; multi-agent systems as a society of autonomous agents; agent communication; mobile agents and security issues; agent execution environment - basic capabilities and review; semantic web and software agents; agent collaboration; distributed problem solving - role of planning; learning in an agent society; benefits of an agent based system; example applications.

Hiranmay Ghosh is heading the Tata Infotech Research Group, Delhi center. His current research interests are Information Retrieval, Multimedia Systems and Agent Based Applications.

Abstract : This tutorial will discuss the use of multi-objective evolutionary algorithms in one of the data mining tasks called rule mining. The goal of data mining is to discover patterns from large volumes of data. After post processing through these patterns the desired knowledge/rule are discovered. These rules should satisfy the properties: predictive accuracy, comprehensibility and interestingness.

Ashish Ghosh received the B.E. degree in Electronics and Telecommunication from Jadavpur University, and the M.Tech. and Ph.D. degrees in Computer Science from ISI Calcutta. He is an Associate Professor with the Machine Intelligence Unit of Indian Statistical Institute, Calcutta. He is a recipient of the INSA young scientist award and is an Associate of the Indian Academy of Sciences. His research interests are in Soft Computing, Data Mining, Image Processing, Evolutionary Computation, Neural Networks, and Fuzzy Sets.

Satchidananda Dehuri is a lecturer in Computer Science at Biju Pattnaik Institute of Information Technology & Management Studies(BIITMS), Bhubaneswar, Orissa.

Abstract: The recent trend is to incorporate intelligence in the sensor, so that it can correct itself in the case of non-ideal behavior arising out of various factors. This can be done by use of Artificial Neural Network (ANN). Here in this tutorial we shall discuss how ANN can be utilized to make a sensor intelligent enough to correct itself.

A. Patnaik, after his Ph.D., is presently working as an Asst. Professor in the Department of Electronics and Communications Engineering in National Institute of Science and Technology, Berhampur, Orissa.

B. S. Pattanaik did his B.E. from NIST, Berhampur, and is currently a lecturer at NIST, Berhampur.

Abstract: Soft computing is a consortium of methodologies, working synergistically rather than competitively, which aims to exploit the tolerance for imprecision, uncertainty, approximate reasoning and partial truth in order to achieve tractability, robustness and close resemblance to the human reasoning processes. The primary aim of all the components of soft computing is to attain acceptable solutions at low cost, rather than aiming for the exact solution by expending a huge amount of computational effort. The problems solved using soft computing tools may also be imprecisely formulated. The major components of soft computing are fuzzy sets, neural networks and evolutionary algorithms. In this tutorial we will first describe the basic principles of soft computing. Subsequently, its three major components will be explained in some detail. A practical application of soft computing for solving a real-life problem will then be described. Finally, mention of new and emerging tools like rough sets and case based reasoning will be made.

S. Bandyopadhyay did her Bachelors in Physics and Computer Science from Calcutta University. She did her Masters in Computer Science from IIT Kharagpur and Ph.D in Computer

Science from Indian Statistical Institute, Calcutta. She is currently an Assistant Professor at

Indian Statistical Institute, Calcutta. She is a recipient of the Young Scientist Awards of the Indian National Science Academy (INSA) and the the Indian Science Congress Association (ISCA) in 2000. Her research interests include Pattern Recognition, Data Mining, Soft & Evolutionary Computation, Image Processing and Parallel & Distributed Systems.

Ujjwal Maulik did his Masters and Ph.D in Computer Science in 1991 and 1997 respectively from Jadavpur University, India. He is currently a faculty in the Department of Computer Science and Technology, Kalyani Government Engineering College, Kalyani University, where he has also served as the Head of the Computer Science and Technology Department during 1996-1999. His research interests include Parallel and Distributed System, Artificial Intelligence and Combinatorial Optimization, Soft Computing,

Pattern Recognition and Image Processing.

TUTORIAL 8: Finite-state modeling in software

Abstract: The finite-state model is the simplest and most widely used high-level model for a software. It also forms the basis of more advanced models such as Petri-nets. The finite-state models are applicable for both small and large software systems, including real-time systems. We discuss general techniques for building finite-state models from the software requirements and techniques for simplifying a finite-state model. We also describe methods for extracting the model from an existing software system, which can then serve as a high-level software documentation. We show how certain model-simplification can help to uncover design flaws and improve the software design. We illustrate each step with detailed examples. We close the discussion with an example of several finite-state models working together. This is the typical case for case for a model of large, complex systems.

Sukhamoy Kundu received his PhD from University of California, Berkeley. He is currently an Associate Professor in the Computer Science Department of Louisiana State University, USA.

His research interests are in software engineering, machine learning and data mining, artificial intelligence, fuzzy sets and fuzzy logic and graph algorithms.

Dr. Avaya Karandikar obtained his PhD from IIT Kanpur in 1994. He has worked in Space Applications Centre, ISRO during 1988-89 and Centre for Development of Advanced Computing, Pune during 1994-97. Since 1997, he is working in IIT Bombay where currently he is an Associate Professor. He has consulted extensively for industries in the area of quality of service guarantees in Internet. His research interests include next generation networks.

Abstract: In today's Internet, a service provider has to meet not only the Quality of Service (QoS) guarantees but at the same time has to engineer the network suitably for optimal performance. These QoS and traffic engineering requirements are difficult to achieve in the traditional IP networks. Multi Protocol Label Switching (MPLS) addresses these service requirements for the next generation Internet. In this talk, we will give an overview of MPLS technology. We will also explain the motivation for MPLS and its applicability in traffic engineering for IP networks. In the second part of the talk, we will also discuss about Multi-threaded implementation of MPLS signaling protocol being developed at IIT Bombay. A network planner may want to determine the performance of a traffic engineering approach in a real MPLS network. This provides us the motivation to design and develop a Linux based MPLS Emulator that can be used as a network planning tool as well. In our emulator, multiple MPLS switching nodes are emulated by re-entering the switching engine implemented in Linux kernel of the host machine. Another unique feature of our design is the emulation of packet forwarding behavior by a software device called `MPLS Device'. The emulator leverages upon our MPLS Forwarding Engine and a multi-threaded implementation of control protocol. We will explain the features of our emulator design.

Dr. Mohanty is Professor in the Centre for Atmospheric Sciences at the Indian Institute of Technology, Delhi, India where he has been since 1979. He received his M.Sc. in physics from Utkal University, Bhubaneswar, India in 1971 and Ph.D. in Tropical Meteorology from USSR Supreme Attestation Commission (Moscow) in 1978. He served as Head of the Centre for Atmospheric Sciences, IIT Delhi during 1998-2001. Dr. Mohanty’s research interests have been in Numerical Weather Prediction, Tropical Meteorology, Monsoon Dynamics, Meso-scale and Climate Modeling. His Ph.D. thesis was on tropical cyclones in the Bay of Bengal and objective methods for prediction of their tracks. He has published more than 100 research papers in reviewed international and national journals and more than 100 paper presentations in international and national conferences / symposia/workshops. He was on deputation to the National Centre for Medium Range Weather Forecasting (NCMRWF), Department of Science & Technology, Govt. of India during 1993-95 as Head and Jt. Advisor of Research Division and was responsible to operationalise medium range weather forecasting system for first time in India with use of CRAY Super Computer. Dr. Mohanty has also extensively visited to UK, USA, France, Italy on different assignments. Dr. Mohanty has received several awards and honours: prestigious Shanti Swarup Bhatnagar Prize (1993), 12th Mausam Award (1989), Samanta Chandra Sekhar Award (1999), AR&DB Silver Jubilee Award (1996), Prof. M.G. Deshpande Award (1984), elected Fellow of Indian Academy of Sciences (1993), Fellow, National Academy of Sciences – India (1997) and Fellow, Indian Meteorological Society (1999).

Abstract: Tropical cyclones in the Bay of Bengal are considered to be the most devastating natural hazard in India. In recent years with advancement of computing resources, satellite and radar observations and quantum jump in communication set ups, numerical weather prediction models are widely used for prediction of tropical cyclones both in operational and research modes. In this presentation a high resolution non-hydrostatic atmospheric model is ued to predict track and intensity of Orissa super cyclone of 1999. The non-linear dynamical system and complex physical processes of the model are solved numerically and integrated up to 5 days in advance using a super computer system. The model simulation results are compared with best-fit track, rainfall and wind observation/estimates obtained from India Meteorological Department. The model is found to perform reasonably well in simulating the track and intensity of the Orissa super cyclone – 1999.

Ashok Panda is a practicing Senior Advocate in the Supreme Court of India in the fields of: Constitutional law, and laws relating to Information Technology, Communications, Corporate sector, Arbitration, and Foreign Exchange Regulations. Currently, he is visiting the University of Louisville in U.S.A. on the invitation of the Department of Political Science and the Liberal Arts Program. He is delivering public lectures and speaking to students on themes concerning laws relating to the Constitution and the Information Technology. Mr. Panda graduated in law from Delhi University in 1976. He has represented the State of Orissa in the Supreme Court (1986 to 1995). He has been appointed amicus curiae to assist the Supreme Court in Public Interest Litigations raising issues of accountability and transparency in Public Administration. He is representing Ministries of Finance, Defence, Communications and Information and Broadcasting of the Government of India and Corporations, such as, Bharat Sanchar Nigam Limited (BSNL) and the Prasar Bharati in the Supreme Court and the Delhi High Court.

Abstract: Right to Privacy has developed into a constitutional right in view of judicial creativism by Supreme Court in the USA. Gradually, in India as well as through-out the democratic world, privacy is recognized as basic human right. Securing privacy in the Internet and telecommunications is imperative for the development of e-commerce. Ironically, technological innovations have led to computer programs posing serious threats to confidentiality in communications among the users of the Internet. The legal framework granting data protection privacy are still not adequate to generate confidence among the users of the Internet. Even the traditional route of encryption is not an appropriate response in this regard. Therefore, time has come to give an in-depth look into developing further technological innovations along with corresponding legal regimes to safeguard the integrity of the e-commerce related communications.

Dr. Krishnaiyan Thulasiraman holds the Hitachi Chair and is Professor in the School of Computer Science at the University of Oklahoma, Norman, U.S.A where he has been since 1994. He received his Ph.D. in electrical engineering from the Indian Institute of Technology, Madras, India in 1968. Prior to joining the University of Oklahoma, Dr. Thulasiraman was professor (1981-1994) and chair (1993-1994) of the ECE Department in Concordia University, Montreal Canada. He was on the faculty in the EE and CS departments of the IIT, Madras during 1965-1981 and served as professor in CS from 1977. Dr. Thulasiraman’s research interests have been in graph theory, combinatorial optimization, and algorithms emphasizing applications in a variety of areas in CS and EE. He has published extensively in archival journals, and coauthored with M.N.S.Swamy two text books Graphs, Networks, and Algorithms (1981) and Graphs: Theory and Algorithms (1992), both published by Wiley Inter-Science. Dr. Thulasiraman has received several awards and honors: Elected Member of the European Academy of Sciences (2002), IEEE Circuits and Systems Society Golden Jubilee Medal (1999), Fellow of the IEEE (1990), Senior Research Fellow of the Japan Society for Promotion of Science (1988), and Guest Professor of the German National Science Foundation (1990). Dr.Thulasiraman has also held visiting positions at the Tokyo Institute of Technology, University of Karlsruhe, Germany, University of Illinois at Urbana-Champaign and Chuo University, Tokyo. Dr. Thulasiraman has been professionally very active. He has held several administrative (including Vice-President) and technical positions with the IEEE Circuits and Systems and other professional organizations. Recently he founded the Technical Committee on "Graph Theory and Computing " of the IEEE Circuits and Systems Society.

Abstract: Graph theory and combinatorial optimization techniques play an important role in the design, analysis and control of telecommunication networks. These techniques include algorithms for finding shortest paths, determining a maximum flow, finding a minimum cost tree etc. Though most problems encountered in telecommunication network studies are computationally intractable, the above graph theoretic algorithms have served as building blocks in designing efficient heuristics for these computationally hard problems. Finding a minimum cost delay-constrained routing is one such problem. In this paper we begin with a broad overview of the current state of the art in this area. We then give a detailed exposition of two recent heuristics and provide a comparative evaluation of these heuristics with respect to the performance of certain other approaches.

Dr. Ajit Singh completed his B.Sc. degree in Electronics and Communication Engineering (1979) at BIT Sindri, India, and M.Sc. (1986) and Ph.D. (1991) degrees in Computing Science at University of Alberta, Canada. From 1980 to 1983, he worked at the R & D department of Operations Research Group, the representative company for Sperry Univac Computers in India. From 1990 to 1992, he was involved with the design of telecommunication systems at Bell-Northern Research, Ottawa. He is currently an associate professor at the Department of Electrical and Computer Engineering, University of Waterloo. Dr. Singh is interested in the areas of software engineering, network computing, and database systems.

Abstract: The cost of developing and maintaining a web-based information system (WIS) is generally very high due to constantly changing underlying technologies and frequent modifications to original requirements. The lack of clear requirements specifications during the initial development stages also complicates the problem. Furthermore, a WIS can become extremely complex and sophisticated as it evolves. This paper proposes a novel development paradigm, called WISDOM that intends to reduce the development cost by automatic source code generation. The implementation model for WISDOM involves dealing with rapid generation of the first prototype as well as future versions of a web-based information system. The approach is based on generating the source code for the information system based on the database schema and code templates. This approach of software reuse allows partial decoupling of business logic related code from schema information thus reducing maintenance costs inflicted by schema updates. The WISDOM system has been implemented using Enterprise Java Beans (EJB) technology. The paper provides a case study and its results to illustrate the impact of this methodology on the development cost for Web-based information systems.