Introduction to TCP/IP: Issues in IPV4, IPV6 protocol, Mature Packet Switching Protocols: ITU Recommendation X.25, User Connectivity, Theory of Operations, Network Layer Functions, X.75 Internetworking Protocol, Advantages and Drawbacks
UNIT I INTRODUCTION
Introduction to Mobile Computing – Applications of Mobile Computing- Generations of Mobile Communication Technologies- Multiplexing – Spread spectrum -MAC Protocols – SDMA- TDMA- FDMA- CDMA
1. The document describes an artificial intelligence implementation of the tic-tac-toe game using the minimax algorithm.
2. It provides details on the game rules, initial and goal states, and the state space tree and winning conditions.
3. The minimax approach is then explained as a recursive algorithm that evaluates all possible future moves from the current state and assumes the opponent will make the choice that results in the least preferred outcome.
The protocol is based on the Routing Information Protocol (RIP).[1] The router generates a routing table with the multicast group of which it has knowledge with corresponding distances (i.e. number of devices/routers between the router and the destination). When a multicast packet is received by a router, it is forwarded by the router's interfaces specified in the routing table.
DVMRP operates via a reverse path flooding technique, sending a copy of a received packet (specifically IGMP messages for exchanging routing information with other routers) out through each interface except the one at which the packet arrived. If a router (i.e. a LAN which it borders) does not wish to be part of a particular multicast group, it sends a "prune message" along the source path of the multicast.
The document provides an overview of constraint satisfaction problems (CSPs). It defines a CSP as consisting of variables with domains of possible values, and constraints specifying allowed value combinations. CSPs can represent many problems using variables and constraints rather than explicit state representations. Backtracking search is commonly used to solve CSPs by trying value assignments and backtracking when constraints are violated.
Slides were formed by referring to the text Machine Learning by Tom M Mitchelle (Mc Graw Hill, Indian Edition) and by referring to Video tutorials on NPTEL
Network Layer addresses data at the logical and physical levels. Logical addresses are generated by CPUs and allow virtual addressing, while physical addresses map to specific memory locations. The network layer provides routing across multiple physical links from one device to another. IP addresses uniquely identify devices on the Internet, though they can change over time as connections change. IPv6 was developed to address the impending exhaustion of IPv4 addresses by expanding the address space to 128 bits.
This document discusses deterministic and non-deterministic algorithms. A deterministic algorithm always produces the same output for a given input, while a non-deterministic algorithm may have multiple possible outputs for one input. Non-deterministic algorithms have two stages: a guessing stage that generates a potential solution, and a verification stage that checks if the guess is correct. Examples of non-deterministic algorithms given are a search algorithm that guesses a location containing the search value, and a sorting algorithm that guesses the sorted order of elements.
This document discusses algorithms analysis and recurrence relations. It begins by defining recurrences as equations that describe a function in terms of its value on smaller inputs. Solving recurrences is important for determining an algorithm's actual running time. Several methods for solving recurrences are presented, including iteration, substitution, recursion trees, and the master method. Examples are provided to demonstrate each technique. Overall, the document provides an overview of recurrences and their analysis to determine algorithmic efficiency.
Artificial Intelligence (AI) | Prepositional logic (PL)and first order predic...Ashish Duggal
The following are the topics in this presentation Prepositional Logic (PL) and First-order Predicate Logic (FOPL) is used for knowledge representation in artificial intelligence (AI).
There are also sub-topics in this presentation like logical connective, atomic sentence, complex sentence, and quantifiers.
This PPT is very helpful for Computer science and Computer Engineer
(B.C.A., M.C.A., B.TECH. , M.TECH.)
This document discusses recurrence relations and methods for solving recurrences. It introduces recurrence relations and examples. It covers the substitution method, iteration method, and Master Theorem for solving recurrences. The Master Theorem is a technique for solving divide-and-conquer recurrences to determine asymptotic tight bounds. Examples are provided to demonstrate applying these techniques.
Computer Networks Unit 2 UNIT II DATA-LINK LAYER & MEDIA ACCESSDr. SELVAGANESAN S
The document discusses data link layer framing and protocols. It describes:
1) Two main approaches to framing - byte-oriented (using sentinel characters) and bit-oriented (using bit stuffing). Protocols discussed include BISYNC, DDCMP, and HDLC.
2) Features of PPP framing including negotiated field sizes and use of LCP control messages.
3) Functions of data link layer including framing, flow control, error control, and media access control. The relationship between the logical link control and media access control sublayers is also covered.
This document discusses deadlock avoidance techniques. It explains the concepts of safe and unsafe states when allocating resources to processes. The resource allocation graph algorithm uses claim and assignment edges to model potential resource requests. Banker's algorithm requires processes to declare maximum resource needs upfront. It uses an allocation matrix and need matrix to determine if allocating resources to a process will result in an unsafe state. An example demonstrates tracking available resources and determining if processes can safely obtain requested resources without causing deadlock.
The document discusses expert systems, which are computer programs that emulate human decision making. An expert system consists of two main parts: the inference engine, which reasons about knowledge like a human, and the knowledge base, which contains the variable information. Inference can proceed through forward chaining or backward chaining. The document also discusses knowledge representation techniques and the roles of knowledge workers and knowledge work systems.
The document discusses various problem solving techniques in artificial intelligence, including different types of problems, components of well-defined problems, measuring problem solving performance, and different search strategies. It describes single-state and multiple-state problems, and defines the key components of a problem including the data type, operators, goal test, and path cost. It also explains different search strategies such as breadth-first search, uniform cost search, depth-first search, depth-limited search, iterative deepening search, and bidirectional search.
dynamic programming complete by Mumtaz Ali (03154103173)Mumtaz Ali
The document discusses dynamic programming, including its meaning, definition, uses, techniques, and examples. Dynamic programming refers to breaking large problems down into smaller subproblems, solving each subproblem only once, and storing the results for future use. This avoids recomputing the same subproblems repeatedly. Examples covered include matrix chain multiplication, the Fibonacci sequence, and optimal substructure. The document provides details on formulating and solving dynamic programming problems through recursive definitions and storing results in tables.
This document contains instructions for several Java programming exercises involving classes, packages, inheritance, overriding, exceptions, and threads. It outlines code for programs that demonstrate concepts like classes and objects, command line arguments, bitwise operators, method overriding, and packages. For each exercise, it provides the aim, algorithm, sample code, input/output, and result to verify the output. The exercises are intended to help students learn and practice core Java programming concepts.
The document describes a Python program that allows users to play Tic-Tac-Toe against the computer. The program uses a command line interface to display a 3x3 grid where users can place an 'X' or 'O' by entering a number 1-9. The program determines whose turn it is, checks for a win or draw after each turn, and repeats the game without errors. It was created using the Python programming language, Python 3.6 interpreter, and Atom text editor on an Intel processor with 512MB of memory. Potential future improvements include a graphical user interface, multiplayer mode, and difficulty levels.
This document describes a cryptarithmetic problem and its step-by-step solution. A cryptarithmetic problem involves representing digits with letters in an arithmetic equation. The problem requires assigning each letter a unique digit such that the equation is correct. This example problem represents the addition of two four-digit numbers with letters. The solution proceeds by deducing the possible digits that each letter can represent based on logical constraints at each step, ultimately arriving at the final solution.
MIME (Multipurpose Internet Mail Extensions) allows for the exchange of rich content beyond plain text in internet messages. It defines a format for describing message content types like text, images, audio and video. MIME uses techniques like character set encoding and base64 encoding to package binary files for transmission over the internet in email and web protocols. It is specified in a series of RFC documents and involves setting the Content-Type in the message header to indicate the MIME type and encoding.
Algorithm Complexity presentation slides. Time Complexity and Space Complexity analysis using Big-O notation with examples that demonstrates how a function complexity effects to algorithm efficiency.
Heuristic Search in Artificial Intelligence | Heuristic Function in AI | Admi...RahulSharma4566
Heuristic search uses heuristic functions to help optimize problem solving by trying to find solutions in the fewest steps or lowest cost. A heuristic function estimates the cost of reaching the goal state from any given node. There are two types of heuristic functions: admissible functions, which never overestimate cost, and non-admissible functions, which may overestimate cost. Admissible heuristics help guide search towards optimal solutions.
These lecture notes cover the design and analysis of algorithms over 4 modules. Module I introduces algorithms, their characteristics, expectations and analysis. It discusses asymptotic analysis using big O, Ω and Θ notations to analyze the growth of algorithms like insertion sort, which has a worst case running time of Θ(n2). Subsequent modules cover dynamic programming, greedy algorithms, graphs, and NP-completeness. The notes provide an overview of key algorithm design and analysis topics.
This chapter discusses various Python tools and cloud offerings for IoT applications. It provides examples of using the Python boto library to interface with Amazon Web Services like EC2, AutoScaling, S3, RDS, DynamoDB. It also discusses using Python for MapReduce programming and introduces web frameworks like Django. Python packages for JSON, XML, HTTP, email and machine learning are also covered. The chapter concludes with pointers to further reading on Python cloud libraries and services.
This document discusses radio channels and interfaces in GSM networks. It covers topics like:
- The Um interface between the mobile station and base station subsystem.
- Processing of the voice signal from analog to digital conversion through encoding, interleaving and modulation for transmission.
- The different types of radio channels used including traffic channels, control channels, and their logical and physical combinations in bursts and frames.
- Technologies used for efficient transmission like frequency hopping, discontinuous transmission, and power control.
This document contains an assignment with 3 problems:
1. Prove that John likes peanuts using resolution on axioms from a previous assignment.
2. Represent facts about a bridge club in predicate logic and use resolution to prove additional statements.
3. Use resolution to determine what course Steve would like based on given facts about courses.
It also contains examples and explanations of converting statements to clause form and using resolution to prove conclusions. Resolution involves selecting clauses to resolve together and eliminating literals to generate new clauses until a contradiction or empty clause is derived.
Unit 2 discusses knowledge representation, which is important for intelligent systems to achieve useful tasks. It cannot be done without a large amount of domain-specific knowledge. Humans tackle problems using their knowledge resources, so knowledge must be represented inside computers for AI programs to manipulate. The document then defines knowledge representation as the part of AI concerned with how agents think and how thinking enables intelligent behavior. It represents real-world information so computers can understand and utilize knowledge to solve complex problems.
This document contains solutions to questions about data communications techniques. It discusses topics like digital modulation techniques, data rates for different modulation schemes, synchronous time-division multiplexing (TDM) concepts and calculations, and transmission media characteristics. Sample questions are provided about amplitude modulation (AM), phase modulation (PM), frequency-division multiplexing (FDM), transmission media like twisted-pair cable and coaxial cable, and network switching techniques like circuit switching, packet switching and frame switching.
X.25 is a protocol standard developed in the 1970s for wide area network communications. It defines how connections are established and maintained between user devices and network devices. X.25 operates at the physical, data link, and network layers of the OSI model. It uses LAPB at the data link layer and PLP at the network layer to transfer data and establish virtual circuits between DTE devices across a packet switched network. Frame Relay was developed later to provide higher speeds and efficiency compared to X.25.
Artificial Intelligence (AI) | Prepositional logic (PL)and first order predic...Ashish Duggal
The following are the topics in this presentation Prepositional Logic (PL) and First-order Predicate Logic (FOPL) is used for knowledge representation in artificial intelligence (AI).
There are also sub-topics in this presentation like logical connective, atomic sentence, complex sentence, and quantifiers.
This PPT is very helpful for Computer science and Computer Engineer
(B.C.A., M.C.A., B.TECH. , M.TECH.)
This document discusses recurrence relations and methods for solving recurrences. It introduces recurrence relations and examples. It covers the substitution method, iteration method, and Master Theorem for solving recurrences. The Master Theorem is a technique for solving divide-and-conquer recurrences to determine asymptotic tight bounds. Examples are provided to demonstrate applying these techniques.
Computer Networks Unit 2 UNIT II DATA-LINK LAYER & MEDIA ACCESSDr. SELVAGANESAN S
The document discusses data link layer framing and protocols. It describes:
1) Two main approaches to framing - byte-oriented (using sentinel characters) and bit-oriented (using bit stuffing). Protocols discussed include BISYNC, DDCMP, and HDLC.
2) Features of PPP framing including negotiated field sizes and use of LCP control messages.
3) Functions of data link layer including framing, flow control, error control, and media access control. The relationship between the logical link control and media access control sublayers is also covered.
This document discusses deadlock avoidance techniques. It explains the concepts of safe and unsafe states when allocating resources to processes. The resource allocation graph algorithm uses claim and assignment edges to model potential resource requests. Banker's algorithm requires processes to declare maximum resource needs upfront. It uses an allocation matrix and need matrix to determine if allocating resources to a process will result in an unsafe state. An example demonstrates tracking available resources and determining if processes can safely obtain requested resources without causing deadlock.
The document discusses expert systems, which are computer programs that emulate human decision making. An expert system consists of two main parts: the inference engine, which reasons about knowledge like a human, and the knowledge base, which contains the variable information. Inference can proceed through forward chaining or backward chaining. The document also discusses knowledge representation techniques and the roles of knowledge workers and knowledge work systems.
The document discusses various problem solving techniques in artificial intelligence, including different types of problems, components of well-defined problems, measuring problem solving performance, and different search strategies. It describes single-state and multiple-state problems, and defines the key components of a problem including the data type, operators, goal test, and path cost. It also explains different search strategies such as breadth-first search, uniform cost search, depth-first search, depth-limited search, iterative deepening search, and bidirectional search.
dynamic programming complete by Mumtaz Ali (03154103173)Mumtaz Ali
The document discusses dynamic programming, including its meaning, definition, uses, techniques, and examples. Dynamic programming refers to breaking large problems down into smaller subproblems, solving each subproblem only once, and storing the results for future use. This avoids recomputing the same subproblems repeatedly. Examples covered include matrix chain multiplication, the Fibonacci sequence, and optimal substructure. The document provides details on formulating and solving dynamic programming problems through recursive definitions and storing results in tables.
This document contains instructions for several Java programming exercises involving classes, packages, inheritance, overriding, exceptions, and threads. It outlines code for programs that demonstrate concepts like classes and objects, command line arguments, bitwise operators, method overriding, and packages. For each exercise, it provides the aim, algorithm, sample code, input/output, and result to verify the output. The exercises are intended to help students learn and practice core Java programming concepts.
The document describes a Python program that allows users to play Tic-Tac-Toe against the computer. The program uses a command line interface to display a 3x3 grid where users can place an 'X' or 'O' by entering a number 1-9. The program determines whose turn it is, checks for a win or draw after each turn, and repeats the game without errors. It was created using the Python programming language, Python 3.6 interpreter, and Atom text editor on an Intel processor with 512MB of memory. Potential future improvements include a graphical user interface, multiplayer mode, and difficulty levels.
This document describes a cryptarithmetic problem and its step-by-step solution. A cryptarithmetic problem involves representing digits with letters in an arithmetic equation. The problem requires assigning each letter a unique digit such that the equation is correct. This example problem represents the addition of two four-digit numbers with letters. The solution proceeds by deducing the possible digits that each letter can represent based on logical constraints at each step, ultimately arriving at the final solution.
MIME (Multipurpose Internet Mail Extensions) allows for the exchange of rich content beyond plain text in internet messages. It defines a format for describing message content types like text, images, audio and video. MIME uses techniques like character set encoding and base64 encoding to package binary files for transmission over the internet in email and web protocols. It is specified in a series of RFC documents and involves setting the Content-Type in the message header to indicate the MIME type and encoding.
Algorithm Complexity presentation slides. Time Complexity and Space Complexity analysis using Big-O notation with examples that demonstrates how a function complexity effects to algorithm efficiency.
Heuristic Search in Artificial Intelligence | Heuristic Function in AI | Admi...RahulSharma4566
Heuristic search uses heuristic functions to help optimize problem solving by trying to find solutions in the fewest steps or lowest cost. A heuristic function estimates the cost of reaching the goal state from any given node. There are two types of heuristic functions: admissible functions, which never overestimate cost, and non-admissible functions, which may overestimate cost. Admissible heuristics help guide search towards optimal solutions.
These lecture notes cover the design and analysis of algorithms over 4 modules. Module I introduces algorithms, their characteristics, expectations and analysis. It discusses asymptotic analysis using big O, Ω and Θ notations to analyze the growth of algorithms like insertion sort, which has a worst case running time of Θ(n2). Subsequent modules cover dynamic programming, greedy algorithms, graphs, and NP-completeness. The notes provide an overview of key algorithm design and analysis topics.
This chapter discusses various Python tools and cloud offerings for IoT applications. It provides examples of using the Python boto library to interface with Amazon Web Services like EC2, AutoScaling, S3, RDS, DynamoDB. It also discusses using Python for MapReduce programming and introduces web frameworks like Django. Python packages for JSON, XML, HTTP, email and machine learning are also covered. The chapter concludes with pointers to further reading on Python cloud libraries and services.
This document discusses radio channels and interfaces in GSM networks. It covers topics like:
- The Um interface between the mobile station and base station subsystem.
- Processing of the voice signal from analog to digital conversion through encoding, interleaving and modulation for transmission.
- The different types of radio channels used including traffic channels, control channels, and their logical and physical combinations in bursts and frames.
- Technologies used for efficient transmission like frequency hopping, discontinuous transmission, and power control.
This document contains an assignment with 3 problems:
1. Prove that John likes peanuts using resolution on axioms from a previous assignment.
2. Represent facts about a bridge club in predicate logic and use resolution to prove additional statements.
3. Use resolution to determine what course Steve would like based on given facts about courses.
It also contains examples and explanations of converting statements to clause form and using resolution to prove conclusions. Resolution involves selecting clauses to resolve together and eliminating literals to generate new clauses until a contradiction or empty clause is derived.
Unit 2 discusses knowledge representation, which is important for intelligent systems to achieve useful tasks. It cannot be done without a large amount of domain-specific knowledge. Humans tackle problems using their knowledge resources, so knowledge must be represented inside computers for AI programs to manipulate. The document then defines knowledge representation as the part of AI concerned with how agents think and how thinking enables intelligent behavior. It represents real-world information so computers can understand and utilize knowledge to solve complex problems.
This document contains solutions to questions about data communications techniques. It discusses topics like digital modulation techniques, data rates for different modulation schemes, synchronous time-division multiplexing (TDM) concepts and calculations, and transmission media characteristics. Sample questions are provided about amplitude modulation (AM), phase modulation (PM), frequency-division multiplexing (FDM), transmission media like twisted-pair cable and coaxial cable, and network switching techniques like circuit switching, packet switching and frame switching.
X.25 is a protocol standard developed in the 1970s for wide area network communications. It defines how connections are established and maintained between user devices and network devices. X.25 operates at the physical, data link, and network layers of the OSI model. It uses LAPB at the data link layer and PLP at the network layer to transfer data and establish virtual circuits between DTE devices across a packet switched network. Frame Relay was developed later to provide higher speeds and efficiency compared to X.25.
The document provides an overview of wide area network (WAN) technologies and routing concepts. It defines static and dynamic routing, and covers common dynamic routing protocols like RIP and OSPF. The document also describes WAN technologies such as X.25, Frame Relay, ATM, SONET/SDH, FDDI, DSL, broadband cable, and POTS/PSTN. It provides details on T-carrier systems and their international counterparts. The summary concludes with resources for additional learning on networking fundamentals and the MTA 98-366 exam.
This document provides an overview of wide area network (WAN) technologies and routing. It defines routing as managing data flow between network segments and hosts. Routers use routing tables and IP addresses to determine the path for sending data. Dynamic routing protocols like RIP and OSPF dynamically determine routes and update them when network changes occur. Common WAN technologies discussed include Frame Relay, X.25, ATM, SONET, FDDI, and various types of DSL. The document also covers topics like interior gateway protocols, exterior gateway protocols, virtual circuits, and leased lines.
Here are short notes on X.25, ATM, and Frame Relay:
a. X.25 - X.25 is a protocol suite for packet switched WANs. It establishes switched virtual circuits between DTE devices using X.121 addressing. X.25 uses LAPB for data link layer and PLP for network layer. It provides reliable data transfer over public networks.
b. ATM - Asynchronous Transfer Mode is a cell switching and multiplexing technology designed for B-ISDN. It uses fixed size 53 byte cells and establishes permanent virtual circuits between endpoints. ATM supports real-time multimedia traffic using constant bit rate, variable bit rate and available bit rate.
c. Frame Relay -
The document discusses communications and network security basics including telecommunications, protocols, network architectures, and the OSI model. It provides an overview of each layer of the OSI model and how data is encapsulated as it moves through the layers. Key concepts covered include TCP/IP, IPv4 and IPv6 addressing, tunneling methods, wired transmission types, cable types, and plenum cable requirements.
This document provides an overview of networking concepts including network types, medium access control protocols, TCP/IP protocol suite, addressing, Ethernet frames, ARP, and standards organizations. It begins with an agenda that lists these topics and includes diagrams to illustrate CSMA/CD, the OSI model, TCP/IP encapsulation, and Ethernet encapsulation. Examples are provided for different network devices, addressing formats and protocols.
The document discusses the OSI model and TCP/IP protocols. It describes the seven layers of the OSI model including the physical, data link, network, transport, session, presentation and application layers. It explains how data is passed between layers and segmented for transmission. The document also discusses common network protocol stacks like TCP/IP, compares the OSI model to the TCP/IP model, and describes some common TCP/IP protocols like HTTP, FTP, SMTP and DNS.
This document discusses the data link layer and media access control. It covers topics such as:
- The functions of the data link layer including framing, addressing, error control, and media access control.
- Common data link layer protocols like HDLC, PPP, Ethernet, and IEEE 802.11.
- Link layer addressing using MAC addresses and protocols like ARP.
- Media access control for networks including wired technologies like Ethernet and wireless technologies like IEEE 802.11.
This document provides information on various intranet, extranet, and wide area network (WAN) technologies. It discusses unified threat management (UTM), content distribution networks (CDN), software-defined networking (SDN), metropolitan area networks (MAN), and common WAN concepts and technologies including CSU/DSU, switching, frame relay, X.25, and asynchronous transfer mode (ATM).
Transport protocols establish reliable communication between machines on a network. They provide services like error control, flow control, and multiplexing. The main transport protocols are TCP and UDP. TCP is connection-oriented and provides reliable, ordered delivery. UDP is connectionless and faster but unreliable. Both protocols use port numbers to identify sending and receiving processes and segment packet headers with fields like source/destination port and sequence numbers. DNS is an application layer protocol that maps domain names to IP addresses, enabling human-friendly web addresses. It uses a hierarchical system of root, TLD, and authoritative name servers to resolve names.
A WAN is a network that covers a broad geographic area using multiple interconnected networks. The largest WAN is the Internet, which many organizations use to connect distributed sites. WANs transmit data over various technologies including telephone networks, wireless networks, fiber optic networks and protocols like Frame Relay and ATM. Error correction is important in WANs to ensure reliable data transmission over long distances between sites.
This document provides an overview of various computer networking concepts including:
1. UDP checksum, CRC, and parity check for error detection.
2. Congestion control mechanisms like windowing and acknowledgments to prevent network overload.
3. Token ring and FDDI network topologies that use token passing for media access control.
4. Bridges and LAN emulation that allow connections between different network types.
5. Bit and byte stuffing techniques used to frame data link layer packets for transmission.
The document discusses two network reference models: the OSI model and TCP/IP model. The OSI model has 7 layers - application, presentation, session, transport, network, data link, and physical. It defines the functions performed at each layer to allow for interoperability between vendors. The TCP/IP model has 4 layers - application, transport, internet, and network access. It combines functions of some OSI layers. Both models use encapsulation to break messages into packets at each layer for transmission across a network.
These slides cover a topic on X.25, Frame relay and ATM in Data Communication. All the slides are explained in a very simple manner. It is useful for engineering students & also for the candidates who want to master data communication & computer networking.
Packet switching is a data transmission technique that divides data into small packets before transmission. Each packet contains a header with source and destination addresses, a payload with the original data, and a trailer with a checksum. Packets are transmitted hop-by-hop through a packet switched network and reassembled at the destination. X.25 was an early protocol for packet switched networks that established virtual circuits to provide reliable connections over unreliable transmission links. It defined physical, link, and packet layer protocols to assemble and transmit packets through public data networks. Frame Relay and ATM are later protocols that also use virtual circuits to transmit packets through packet switched networks.
The document outlines the steps for implementing an ERP system, including identifying problems, defining the scope and team, customizing the system, managing change, and testing before going live. It also lists the life cycle steps of selecting a package, planning the project, analyzing gaps, re-engineering processes, providing training, testing, applying the system, and ongoing maintenance.
Electronic customer relationship management (e crm)Pradnya Saval
Electronic customer relationship management (E-CRM) uses internet technologies like email, websites and chatrooms to achieve customer relationship management goals. It automates marketing, sales and customer service processes through collecting customer data. E-CRM provides benefits like improved customer service, productivity and satisfaction by allowing personalized interactions and insights through a consolidated customer database. However, it also faces disadvantages such as security issues and over-reliance on systems reducing human interactions.
A data warehouse is a database that collects and manages data from various sources to provide business insights. It contains consolidated historical data kept separately from operational databases. A data warehouse helps executives analyze data to make strategic decisions. Data mining extracts valuable patterns and knowledge from large amounts of data through techniques like classification, clustering, and neural networks. It is used along with data warehouses for applications like churn analysis, fraud detection, and market segmentation.
An ERP system is an enterprise-wide software that coordinates resources, activities, and information needed to complete business processes. It has modules for human resources, supply chain management, customer relationship management, finance, and manufacturing. ERP architecture is organized into three layers - the data tier focuses on data structure, the business tier includes business logic and user interaction, and the presentation tier is the user interface. ERP systems can use two-tier, three-tier client/server, web-based, or oriented architectures. The logical architecture separates components while the physical focuses on efficiency. ERP features include separation of code and data and modules for business functions, sales, production, materials, finance, and personnel.
The document discusses several major functional systems of organizations, including marketing and sales, finance and accounting, manufacturing/production/inventory, and human resources. It provides details on the components and functions of marketing information systems, such as types of marketing information and the marketing information system model. It also describes the roles and sub-systems of other functional areas like finance and accounting, manufacturing, and human resources.
Supply chain management involves the management of the flow of goods and services from raw materials to final products being delivered to customers. It provides advantages like efficiency, reduced costs and inventory, just-in-time delivery, and increased revenue. The components of an e-supply chain management system include planning, information, sourcing, inventory, production, location, transportation, and return of goods. The architecture of an e-supply chain involves internal operations, inter-organizational operations through shared visions and process modeling, and inter-organizational technologies like integration and networking. Trends in supply chain management include warehouse robotics, autonomous transportation, blurred lines with technology services, and an emphasis on social responsibility.
Knowledge Process Outsourcing (KPO) involves outsourcing knowledge-based activities like research, analytics and business processes to countries like India. KPO is a subset of Business Process Outsourcing (BPO) that also includes other types of outsourcing like Creative, Legal, Recruitment, Human Resources, IT, and Medical outsourcing. A study by NASSCOM projects growth in KPO opportunities in areas like IT, web services, legal and finance processes through both traditional outsourcing and cloud computing models.
The document discusses several major ERP software systems - SAP ERP, Oracle Apps, Microsoft Dynamics NAV, and PeopleSoft. It provides overview information on each software, describing what they are used for and some of their key modules. The major ERP software systems are designed to integrate various business operations like finance, supply chain management, human resources, and customer relationship management.
DBMS stands for Database Management System. A DBMS allows for the storage and management of data in an organized manner. It uses tables to store data with rows and columns, where each row represents a record or tuple of data. Entities, attributes, keys, and relationships help define the structure and integrity of data within the database. The three schema architecture separates the physical storage, logical design, and external user views to provide data independence and abstraction between different levels.
Recurrent neural networks (RNNs) and convolutional neural networks (CNNs) are two common types of deep neural networks. RNNs include feedback connections so they can learn from sequence data like text, while CNNs are useful for visual data due to their translation invariance from pooling and convolutional layers. The document provides examples of applying RNNs and CNNs to tasks like sentiment analysis, image classification, and machine translation. It also discusses common CNN architecture components like convolutional layers, activation functions like ReLU, pooling layers, and fully connected layers.
The document discusses the Integrated Services model which reserves resources like bandwidth and buffers for data flows to ensure requested quality of service (QoS). It requires packet classifiers, schedulers, admission control using the Resource Reservation Protocol, and flow descriptors. The model provides two services: Guaranteed Services which gives a firm delay bound using token bucket algorithms; and Controlled Load Services which tolerates delay but prevents overload for adaptive applications.
This document provides an overview of ATM (Asynchronous Transfer Mode) technology. It discusses the basic concepts of circuit switching, packet switching, and virtual circuit approaches. It then describes ATM including that it is connection-oriented, uses fixed size 53 byte cells, and operates at speeds of 155Mbps or 622Mbps. It outlines the ATM layers including the physical layer, ATM layer, ATM adaptation layer, and upper layers. It also discusses AAL types and the advantages of ATM in supporting different traffic types and efficient bandwidth usage.
Data Communication and Optical Network Pradnya Saval
Defining Data Communication needs, Transmission Hierarchy, Optical Networks: SONET/SDH standard, Architecture, Format, Hardware, Configuration, advantages
Data Communications and Optical Network - ForouzanPradnya Saval
Defining Data Communication needs, Transmission Hierarchy
Optical Networks: SONET/SDH standard, Architecture, Format, Hardware, Configuration, advantages
Integrated services and RSVP - ProtocolPradnya Saval
- MPLS can be used to create virtual private networks (VPNs) that provide wide-area connectivity between sites of a large organization through dedicated label switched paths. This gives the appearance of a dedicated network while transmitting through a public or shared MPLS network.
- The integrated services model was developed by IETF to provide different levels of quality of service in the Internet. It uses resource reservation, packet classification, and scheduling to ensure applications receive their requested QoS.
- The Resource Reservation Protocol (RSVP) is used by the integrated services model to signal resource requirements and set up flows with a requested QoS across a network. RSVP uses soft state and receiver-initiated reservations.
This document discusses RSVP and differentiated services (DS) network models. It provides details on:
1) RSVP uses objects like INTEGRITY, SCOPE, and RESV_CONFIRM carried in messages to establish and maintain reservations. Messages include a common header followed by objects.
2) The DS model aggregates traffic by service level agreements rather than per-flow reservations. Packets are marked with DS field codepoints to receive different per-hop behaviors like expedited forwarding or assured forwarding.
3) DS routers classify and condition traffic at ingress based on DS fields and traffic agreements. Core routers provide behaviors like low latency for expedited forwarding or high assurance delivery for assured forwarding traffic within configured rates.
Introduction to TCP/IP: Issues in IPV4, IPV6 protocol
Mature Packet Switching Protocols:ITU Recommendation X.25, User Connectivity, Theory of Operations, Network Layer Functions, X.75 Internetworking Protocol, Advantages and
Drawbacks
X.75 is an ITU-T protocol that defines how to interconnect multiple private X.25 packet switching data networks, allowing them to share resources and data across international and multiprovider areas by connecting backbone packet switches and translating addresses between networks. It supports multilink procedures between signaling terminal exchanges to facilitate communication between devices in separate X.25 networks located in different countries, like the US and UK, with the X.75 link being transparent to the end users.
Theory of operations - Mature Packet Switching ProtocolsPradnya Saval
This document discusses the theory of operations for packet switching networks. It describes traffic characteristics such as bursty traffic that is delay-insensitive and asymmetrical, making it well-suited for packet switching. The document then explains the basic operation of X.25 packet switching, where data is divided into packets and routed through a network of nodes before being reassembled. Each node acts as a data circuit-terminating equipment and routes packets based on its routing table while performing error checking and retransmission.
The Fluke 925 is a vane anemometer, a handheld device designed to measure wind speed, air flow (volume), and temperature. It features a separate sensor and display unit, allowing greater flexibility and ease of use in tight or hard-to-reach spaces. The Fluke 925 is particularly suitable for HVAC (heating, ventilation, and air conditioning) maintenance in both residential and commercial buildings, offering a durable and cost-effective solution for routine airflow diagnostics.
This paper proposes a shoulder inverse kinematics (IK) technique. Shoulder complex is comprised of the sternum, clavicle, ribs, scapula, humerus, and four joints.
We introduce the Gaussian process (GP) modeling module developed within the UQLab software framework. The novel design of the GP-module aims at providing seamless integration of GP modeling into any uncertainty quantification workflow, as well as a standalone surrogate modeling tool. We first briefly present the key mathematical tools on the basis of GP modeling (a.k.a. Kriging), as well as the associated theoretical and computational framework. We then provide an extensive overview of the available features of the software and demonstrate its flexibility and user-friendliness. Finally, we showcase the usage and the performance of the software on several applications borrowed from different fields of engineering. These include a basic surrogate of a well-known analytical benchmark function; a hierarchical Kriging example applied to wind turbine aero-servo-elastic simulations and a more complex geotechnical example that requires a non-stationary, user-defined correlation function. The GP-module, like the rest of the scientific code that is shipped with UQLab, is open source (BSD license).
Value Stream Mapping Worskshops for Intelligent Continuous SecurityMarc Hornbeek
This presentation provides detailed guidance and tools for conducting Current State and Future State Value Stream Mapping workshops for Intelligent Continuous Security.
International Journal of Distributed and Parallel systems (IJDPS)samueljackson3773
The growth of Internet and other web technologies requires the development of new
algorithms and architectures for parallel and distributed computing. International journal of
Distributed and parallel systems is a bimonthly open access peer-reviewed journal aims to
publish high quality scientific papers arising from original research and development from
the international community in the areas of parallel and distributed systems. IJDPS serves
as a platform for engineers and researchers to present new ideas and system technology,
with an interactive and friendly, but strongly professional atmosphere.
Concept of Problem Solving, Introduction to Algorithms, Characteristics of Algorithms, Introduction to Data Structure, Data Structure Classification (Linear and Non-linear, Static and Dynamic, Persistent and Ephemeral data structures), Time complexity and Space complexity, Asymptotic Notation - The Big-O, Omega and Theta notation, Algorithmic upper bounds, lower bounds, Best, Worst and Average case analysis of an Algorithm, Abstract Data Types (ADT)
Raish Khanji GTU 8th sem Internship Report.pdfRaishKhanji
This report details the practical experiences gained during an internship at Indo German Tool
Room, Ahmedabad. The internship provided hands-on training in various manufacturing technologies, encompassing both conventional and advanced techniques. Significant emphasis was placed on machining processes, including operation and fundamental
understanding of lathe and milling machines. Furthermore, the internship incorporated
modern welding technology, notably through the application of an Augmented Reality (AR)
simulator, offering a safe and effective environment for skill development. Exposure to
industrial automation was achieved through practical exercises in Programmable Logic Controllers (PLCs) using Siemens TIA software and direct operation of industrial robots
utilizing teach pendants. The principles and practical aspects of Computer Numerical Control
(CNC) technology were also explored. Complementing these manufacturing processes, the
internship included extensive application of SolidWorks software for design and modeling tasks. This comprehensive practical training has provided a foundational understanding of
key aspects of modern manufacturing and design, enhancing the technical proficiency and readiness for future engineering endeavors.
"Feed Water Heaters in Thermal Power Plants: Types, Working, and Efficiency G...Infopitaara
A feed water heater is a device used in power plants to preheat water before it enters the boiler. It plays a critical role in improving the overall efficiency of the power generation process, especially in thermal power plants.
🔧 Function of a Feed Water Heater:
It uses steam extracted from the turbine to preheat the feed water.
This reduces the fuel required to convert water into steam in the boiler.
It supports Regenerative Rankine Cycle, increasing plant efficiency.
🔍 Types of Feed Water Heaters:
Open Feed Water Heater (Direct Contact)
Steam and water come into direct contact.
Mixing occurs, and heat is transferred directly.
Common in low-pressure stages.
Closed Feed Water Heater (Surface Type)
Steam and water are separated by tubes.
Heat is transferred through tube walls.
Common in high-pressure systems.
⚙️ Advantages:
Improves thermal efficiency.
Reduces fuel consumption.
Lowers thermal stress on boiler components.
Minimizes corrosion by removing dissolved gases.
2. Contents
• Issues in IPV4
• IPV6 protocol
• Mature Packet Switching Protocols:
• ITU Recommendation X.25,
• User Connectivity,
• Theory of Operations,
• Network Layer Functions,
• X.75 Internetworking Protocol
3. IPV4
• 32-Bit Addressing (2^32 Addresses = 4,294,967,296)
• Studies say that there will not be enough addresses anymore in future due to
the increase in mobile IP generation
4. Issues in IPV4
• Less Address Space
• IP address starvation
• Distribution of addresses (USA >50%)
• Routing is complicated
• Realization of new technologies (Mobile computing, real time services,
multicast, security, QOS, etc.)
5. IPV6
• 128-bit addresses (2^128 Addresses = 3.4*10^38)
• IPv6 resolves the following issues:
• Larger address space
• Better header format
• New options
• Allowance for extension
• Support for resource allocation
• Support for more security
8. Extension Headers (Cont..)
Hop-by-Hop Option: The hop-by-hop option is used when the source needs to pass information to all
routers visited by the datagram.
Source Routing: The source routing extension header combines the concepts of the strict source route and
the loose source route options
Fragmentation: The source or a router is required to fragment if the size of the datagram is larger than the
MTU of the network over which the datagram travels.
Authentication: The authentication extension header has a dual purpose: it validates the message sender and
ensures the integrity of data
Encrypted Security Payload: The encrypted security payload (ESP) is an extension that provides
confidentiality and guards against eavesdropping.
Destination Option: The destination option is used when the source needs to pass information to the
destination only. Intermediate routers are not permitted access to this information
10. TRANSITION FROM IPv4 TO IPv6 (Cont..)
• Dual Stack:
• To determine which version to use when sending a packet to a destination, the source host queries the
DNS. If the DNS returns an IPv4 address, the source host sends an IPv4 packet. If the DNS returns
an IPv6 address, the source host sends an IPv6 packet.
11. TRANSITION FROM IPv4 TO IPv6 (Cont..)
• Tunneling:
• Tunneling is a strategy used when two computers using IPv6 want to
communicate with each other and the packet must pass through a region that
uses IPv4.
12. TRANSITION FROM IPv4 TO IPv6 (Cont..)
• Header Translation:
• Header translation is necessary when the majority of the Internet has moved to IPv6 but some systems
still use IPv4.
13. Switched Communication Network
• Three Types of Switched Communication Network
• Circuit Switched
• Message Switched
• Packet Switched
• Datagram Approach
• Virtual Circuit Approach
15. X.25 Network
• X.25 is a standard reliable protocol for WAN communications
• It is typically used in the packet-switched networks (PSNs) of common carriers, such as the
telephone companies.
• Subscribers are charged based on their use of the network.
• Uses Virtual Circuit Approach
• The devices used in X.25 network fall into three general categories:
• data terminal equipment (DTE),
• data circuit-terminating equipment (DCE),
• packet-switching exchange (PSE) 15
17. ITU Recommendation X.25 Network (Cont..)
• Data Terminal Equipment (DTE)
• Devices are end systems that communicate across the X.25 network.
• They are usually terminals, personal computers, or network hosts, and are located on the
premises of individual subscribers.
• Data communication Equipment (DCEs)
• are communications devices, such as modems and packet switches that provide the interface
between DTE devices and a PSE, and are generally located in the carrier's facilities.
• Packet-switching Exchange (PSEs)
• are switches that compose the bulk of the carrier's network. They transfer data from one
DTE device to another through the X.25 PSN. 17
18. ITU Recommendation X.25 Network (Cont..)
Packet Assembler/Disassembler
• The packet assembler/disassembler (PAD) is a device commonly found in X.25
networks.
• The PAD is located between a DTE device and a DCE device and it performs
three primary functions:
• buffering (storing data until a device is ready to process it),
• packet assembly,
• and packet disassembly 18
19. X.25 Network - Protocol Suite
19
The X.25 protocol suite maps to the lowest three layers of the OSI reference model. The layers are:
• Physical Level: Deals with the physical interface between an attached station and the link that
attaches that station to the packet-switching node. X.21 is the most commonly used physical
layer standard.
20. X.25 Network - Protocol Suite
• Frame (Link) Level:
• Facilitates reliable transfer of data across the physical link by transmitting the data as
a sequence of frames.
• Uses Link Access Protocol Balanced (LAPB), bit oriented protocol.
• Link Layer performs following functions:
• Transfer of data in an efficient and timely fashion
• Synchronization of the link to ensure that the receiver is in step with the transmitter
• Detection of transmission errors and recovery of errors.
• Identification and reporting of procedural errors to higher level for recovery 20
21. X.25 Network - Protocol Suite
Packet Level:
• Responsible for end-to-end
connection between two DTEs.
• Also called as Packet layer Protocol
(PLP)
• Procedures:
• SVC
• PVC
• DGs
• Fast Select 21
• Functions performed are:
• Establishing connection
• Transferring data
• Terminating a connection
• Error and flow control
• With the help of X.25 packet layer, data are
transmitted in packets over external virtual circuits.
24. User Connectivity
• ITU-T Recommendations X.3, X.28 and X.29 are defined as link-level
protocols that provide DTE with asynchronous terminal interfaces to X.25
networks.
• Communicate only via low-speed asynchronous mode.
• X.25 also provides synchronous user connectivity.
• There are three examples of asynchronous and BSC DTE terminal
connectivity options.
26. Interface Protocols of X.25 packet switching
network (Cont..)
• Recommendation X.121: Defines the international numbering plan for packet switching
networks.
• Recommendation X.28: Defines the operational control of these functions between the
character mode terminal DTE device and the DCE packet assembler/disassembler.
• Recommendation X.29: Defines the same controls, but for the host computer destination.
• Recommendation X.3: Defines a PAD concentrator function for start-mode or character-
mode DTE devices.
• Recommendation X.22: Defines X.25 synchronous dial-up mode for DTE services.
28. Traffic Characteristics
• To understand packet switching protocols following details must be known:
• Types of traffic for transport
• Characteristics of traffic
• Bursty Traffic:
• Data Transmission with duration of less than 5 seconds.
• Often travels in one direction rather than equally in both direction.
• Eg: HTTP browsing
29. Traffic Characteristics
• Packet Switching networks accommodate traffic that is not delay-
sensitive.
• Two primary requirements for packet networks are burstiness
and delay-insensitive traffic.
• Due to dynamic allocation of bandwidth technique used by
packet switching, bursty delay-insensitive traffic is ideal for
transport over a packet switching network.
30. • The figure shows that:
• Low speed terminal users at site A, B and C.
• High Speed user host.
• Terminals could use low speed X.3 circuits to
request information downloads from the host.
• Terminal traffic is very light (low-bandwidth
usage) compared to the data traffic from the
host (high-bandwidth usage).
• The single 56Kbps multiplexed X.25 line from
the host into the packet switching network
depicts the efficiency of asymmetrical traffic
patterns where the host will transmit much
more traffic than it receives.
32. X.25 Packet Switching Operation (Cont..)
• Packet Switching Network shows 6 nodes (1-6) each with 3 users (terminal A, B,
and C)
• Each user device is acting as a DTE and each network node is acting as a DCE.
• Packets are routed based on the routing table via different paths.
• Reassembly is done at the receiving node.
• The DTE device transmits data to the network via synchronous mode
X.25protocol.
• Error checking and retransmission is done at every node.
34. Network Layer Functions
• It uses X.25 protocol as it defines the network layer features and functions.
• The concepts are used with respect to:
1. PVCs and VC/SVC
2. VC and LCNs
3. X.25 Control Packet Format
4. Normal Data Packet Format
5. Flow Control and Windowing
6. Fast Connect Option
35. PVCs and SVCs/VC
• Two types of X.25 virtual circuits exists:
• Switched Virtual Circuits (SVCs): These are temporary connections used for
irregular data transfers. They require 2 DTE devices establish, maintain, and terminate a
session each time the devices need to communicate. Eg: Telephonic Call
• Permanent Virtual Circuits (PVCs): These are permanently established connections
used for frequent and consistent data transfers. PVCs do not require that session be
established and terminated. Therefore, DTEs can begin transferring data whenever
necessary because the session is always active.
36. PVCs and SVCs/VC (Cont..)
• Three users of a public X.25
packet switching network.
• Each user has a single DS0
access circuit to network.
• Each PVCs carries traffic in both
the directions.
• SVCs operate in the same
manner, but are established and
terminated on demand.
37. PVCs and SVCs/VC (Cont..)
• Figure shows the standard SVCs X.25 packet
transfer sequence.
• The establishment of an SVC virtual call, data
transfer and then call clearing.
• Data transfer stage can last any amount of time.
• The delay factor must be taken into consideration
during the design.
38. LCN Assignment
• LCN: Logical Channel Number
• The following 5 events occur:
• Link is set up between local DTE & DCE node and also between the remote DTE &
DCE.
• VC is established between the local and remote DTE.
• Data is transferred between two DTEs.
• VC is released.
• Link is disconnected.
39. LCN Assignment (Cont..)
• Upto 4095 (2^12) multiplexed channels between each DTE and DCE are
provided.
• The calling and called hosts use different numbers.
40. X.25 Control Packet Formats
Figure depicts the packet format for call request and
incoming calls
41. X.25 Control Packet Formats (Cont..)
Control packet are used for VC setup and termination.
• The fields used are:
1. General format identifier: Indicates the general format of the rest of the header (call setup,
clearing, flow control, reset or data packet.)
2. Logical Channel Group Number (LCGN): Logical significance for each logical channel.
3. LCNs: Assigned for each incoming and outgoing virtual circuit for each DCE and DTE.
4. Control Packet Type Identifier: Related packet type (format identifier) from DCE to DTE
and from DTE to DCE.
5. Additional Bytes: Contain information that is packet specific (call request or incoming packets,
reset, etc.)
42. X.25 Control Packet Formats (Cont..)
• The various packet types in X.25 packet format are:
1. Clear Packet
2. Interrupt Packet
3. RR and RNR Packet
4. Reset Packet
5. Restart Packet
6. Diagnostic Packet
43. Normal Data Packet Format
Normal Data Packets are transferred
after the call setup and before call
termination.
44. Normal Data Packet Format
• The bits used in the Normal Data Packet Format are:
• Qualified bit (Q): Distinguish between user data or user device control data stream.
• Data bit (D): Set to 0 if the flow and acknowledgment have local significance. Set to 1 to designate
end-to-end-significance.
• LCGN and LCNs: Together provide 12 bits needed to form the VC.
• P(R) and P(S): Designated for the receive and send sequence count respectively.
• More (M) bit: Set to 0 throughout the length of the message, set to 1 for last packet of the message.
• Data field: Specifies the maximum size and contains the actual user data.
46. Flow Control and Windowing (Cont..)
• The send and receive sequence numbers in X.25 packet level are also used to
provide flow control between the packet level source and sink.
• Source is a transmitting device and sink is a device that receives.
• The sequence numbers are incremented modulo the maximum window size.
• The figure before uses Modulo 4 i.e. 0,1,2,3.
• The RSN in the acknowledgment indicates the next SSN expected in the next
packet from the other end of the virtual circuit.
47. Flow Control and Windowing (Cont..)
• The RSN acts as an acknowledgement for all packets up to one less than the
RSN.
• The transmitter can send no more packets than modulo-1 without
acknowledgment.
• As shown in the figure three packets and then waits for the acknowledgment
before sending any additional packets. This is called as sliding window flow
control protocol.
48. Flow Control and Windowing (Cont..)
• This process allows the receiver to control the maximum rate of
transmission over a virtual circuit, mainly used for traffic control.
• The RSN acknowledgment can be piggybacked in the packet header for a
packet headed in the opposite direction on a virtual circuit, or can be sent in
a separate acknowledgment packet.
• Window Size is directly proportional to traffic load on the logical
channel so recources should be wisely used.
50. Fast Connect Option
• Fast Connect Option is also available for fast packet transactions in X.25.
• Each packet has the call request format together with the data so the
establishment of a virtual circuit is not required.
• There are two types of fast connect option:
• Fast select call
• Fast select with immediate clear
51. Fast Connect Option (Cont..)
1. Fast select call:
• The packet select packet from user A has both call request and user data (upto 128bytes
of data) and user B can respond with a call-accept packet that also contains user data
from user B.
• The rest of the call connection and disconnect works the same as an SVC call
2. Fast select with immediate clear:
• This is similar to fast select with the call request packet establishing the connection and
the clear indication packet terminating the connection.
53. X.75 Internetworking Protocol (Cont..)
• ITU-T Recommendation X.75 defines the protocol structure and procedures
for internetworking multiple X.25 packet switching private data networks
(PSPDNs).
• X.75 can be used to:
• share network resources and data across the international or mutiprovider area.
• connect larger backbone packet switches to one another.
• Translate address in conjunction with the X.121 address protocol standard.
• Multilink procedures to support multiple links between signalling terminal exchange (STE).
54. X.75 Internetworking Protocol (Cont..)
• The figure shows DTEs from 2 separate X.25 networks located in US and
UK communicating via X.75 protocol.
• The X.75 link is transparent to the end user.
• The figure is an example of X.75 being used as an international packet
switching service.