MULTIMEDIA MESSAGING SERVICE - paper presentation

MULTIMEDIA MESSAGING SERVICE

Multimedia Messaging Service (MMS) adds images, text, audio clips and ultimately, video clips to SMS (Short Message Service / text messaging). Simon Buckingham, CEO of Mobile Streams believes that: 'The transition from Short Message Service (SMS) to Multimedia Messaging Service (MMS) is as important on mobile phones as the transition from DOS to Windows was for the PC. It represents a revolution.' Unlike other technologies like WAP, Bluetooth etc - MMS offers a complete development and billing environment along with a chance to create compelling applications. Thus, MMS provides an opportunity to foster an industry where all players in the value chain may get an opportunity to earn revenue. Download Presentation

The Object Oriented Features Of C++ -- paper presentation

The Object Oriented Features Of C++

OBJECT Object is a concept, abstraction, or thing with crisp boundaries and meaning for the problem at hand .Objects serves two purposes: they promote understanding of the real world and provide a practical basis for computer implementation. Decomposition of a problem in to objects depends on judgment and nature of the problem. All objects have identity and are distinguishable .Two apples with the same colour, shape, and texture are still individual apples. CLASS An object class describes a group of objects with similar properties, common behavior, common relationships to the other objects and common semantics. Person, company animal, process and window are all object classes. Object in a class have the same attributes and behavior pattern. Download Presentation

SLAMMER WORM-Paper prentation

SLAMMER WORM: SLAMMER WORM: THE FASTEST SPREADING BOMBSHELL ON THE INTERNET Slammer Worm: A glance onto the facts. Slammer (sometimes called Sapphire) was the fastest computer worm in history. As it began spreading throughout the Internet, the worm infected more than 90 percent of vulnerable hosts within 10 minutes, causing significant disruption to financial, transportation, and government institutions and precluding any human-based response. In this seminar, I wish to describe how it achieved its rapid growth, dissect portions of the worm to study some of its flaws, and look at the defensive effectiveness against it and its successors. Slammer began to infect hosts on Saturday, 25 January 2003, by exploiting buffer-overflow vulnerability in computers on the Internet running Microsoft's SQL Server or Microsoft SQL Server Desktop Engine (MSDE) 2000. David Litchfield of Next Generation Security Software discovered this underlying indexing service weakness in July 2002; Microsoft released a patch for the vulnerability before the vulnerability was publicly disclosed. Exploiting this vulnerability, the worm infected at least 75,000 hosts, perhaps considerably more, and caused network outages and unforeseen consequences such as canceled airline flights, interference with elections, and ATM failures Download Presentation

Fault Detection: paper presentation

Fault Detection: Let x1,x2,x3................xn be the inputs to a combinational circuit in the presence of fault k. As an example consider the circuit may be either stuck at zero (s-a-0) or stuck at one (s-a-1). We shall denote by m0 and m1 the faults of wire m s-a-0 and s-a-1 respectively. Similar notation is used for the other wires. The truth table for this circuit is shown in figure(b). Where coulmn f denotes the fault free output while, for example coulmns f(m0) and f(m1) corresponed ,respectively to the circuit output in the presence of faults m0 and m1 and so on. An input combination is referred to as a test for fault fk if , in response to that input combination, the output of the correctly operating circuit is different from that of the circuit impaired by fault fk . Hence , for example ,the input combination 111 is the only test for detecting the fault , f(m0) in the circuit of figure(c) . Since it is the only input combination for which the value in the coulmn f and f(m0///0 are different . n the other hand , fault f(q1) can be detected by the tests 001,011,and 101 and so on,for other faults. More precisely , an input combination a1,a2,a3,a4.....aN is a test for detecting fault fk if and only if f(a1,a2,a3....aN) fk(a1,a2,a3,.....aN)=1 where f (a1,a2,a3..aN) and fk(a1,a2,a3,.........aN) denote respectively the fault free output and the incorrect output in response to the input a1,a2,a3,....aN .Thus in order to determine all the tests that detect a fault fk , it is necessary to take the modulo-2 sum of coulmn f and fk in the truth table. Download Presentation

Mobile computing paper presentation

Mobile computing MOBILE COMPUTING FRAMEWORK: Mobile computing is expanding in four dimensions (a)Wireless delivery technology and switching methods: � Radio- based systems
� Cellular communications
� Wireless packet data networks
� Satellite networks
Infrared or light based mobile computing
(b)Mobile information access device:
� Portable Computers
� PDA
� Palmtops
(c) Mobile data internetworking standards and equipments:
� CDMA
� IrDA
(d) Mobile computing based business application:
Dreams behind mobile computing: Download Presentation

Btech ECE paper presentations-THE SOCKET INTERFACE

THE SOCKET INTERFACE
We must have an interface between the application programs and the protocol software in order to use network facilities. My seminar is on a model of an interface between application programs and TCP/IP protocols. The standard of TCP/IP protocol do not specify exactly how application programs interact with the protocol software. Thus the interface architecture is not standardized; its design lies outside of scope of the protocol suite. It is further should be noticed that it is inappropriate to tie the protocols to a particular interface because no single interface architecture works well on all systems. In particular, because protocol software resides in a computer�s operating system, interface details depend on the operating system. In spite of lack of standards, a programmer must know about the such interfaces to be able to use TCP/IP. Although I have chosen UNIX operating system in order to explain the model, it has widely accepted and is used in many systems. One thing more, the operations that I will list here, will have no standard in any sense.
Download Presentation

BTech paper Presentations -- Real Time Task scheduling

Real Time Task scheduling

A real time system is used when rigid time requirements have been placed on the operation of a processor or the flow of data; thus it is often used as a control device in a dedicated application. The purpose of real time computing is to execute, by the appropriate deadlines its critical control tasks.The allocation/scheduling problem is: Given a set of tasks, task precedence constraints, resource requirements, task characteristics and deadlines we are asked to devise a feasible allocation/schedule on a given computer. It�s an ongoing topic of research and the vast majority of assignment/scheduling problems on systems with more than two processors are NP-complete.

Download Presentation