computer Networks Error Detection and Correction.ppt

Apr 2, 2024Download as PPT, PDF1 like1,048 views

This document discusses error detection and correction in data transmission. It covers the following key points: - There are two main types of errors: single-bit errors and burst errors. Burst errors are more common in serial transmission. - Error detection verifies data accuracy without having the original message. It uses redundancy like vertical and longitudinal redundancy checks. Cyclic redundancy checks use polynomial division to detect errors. - Error correction automatically fixes certain errors. Single-bit error correction reverses the value of the altered bit. Hamming codes use additional redundant bits to detect and correct single-bit errors.

Error Detection
and Correction
• Types of Errors
• Detection
• Correction

Basic concepts
 Networks must be able to transfer data from
one device to another with complete accuracy.
 Data can be corrupted during transmission.
 For reliable communication, errors must be
detected and corrected.
 Error detection and correction
are implemented either at the data link
layer or the transport layer of the OSI
model.

Single bit errors are the least likely type of
errors in serial data transmission because
the noise must have a very short duration
which is very rare. However this kind of
errors can happen in parallel transmission.

computer Networks Error Detection and Correction.ppt

The term burst error means that two or
more bits in the data unit have changed
from 1 to 0 or from 0 to 1.
Burst errors does not necessarily mean that
the errors occur in consecutive bits, the
length of the burst is measured from the first
corrupted bit to the last corrupted bit. Some
bits in between may not have been
corrupted.

Burst error is most likely to happen in serial
transmission since the duration of noise is
normally longer than the duration of a bit.
The number of bits affected depends on the data
rate and duration of noise.

Error detection
Error detection means to decide whether the
received data is correct or not without having a
copy of the original message.
Error detection uses the concept of redundancy,
which means adding extra bits for detecting
errors at the destination.

Four types of redundancy checks are used
in data communications

Performance
It can detect single bit error
It can detect burst errors only if the total
number of errors is odd.

Performance
LCR increases the likelihood of detecting
burst errors.
If two bits in one data units are damaged
and two bits in exactly the same positions in
another data unit are also damaged, the LRC
checker will not detect an error.

Cyclic Redundancy Check
• Given a k-bit frame or message, the
transmitter generates an n-bit sequence,
known as a frame check sequence (FCS), so
that the resulting frame, consisting of (k+n)
bits, is exactly divisible by some
predetermined number.
• The receiver then divides the incoming
frame by the same number and, if there is
no remainder, assumes that there was no
error.

At the sender
The unit is divided into k sections, each of n
bits.
All sections are added together using one’s
complement to get the sum.
The sum is complemented and becomes the
checksum.
The checksum is sent with the data

At the receiver
The unit is divided into k sections, each of n
bits.
All sections are added together using one’s
complement to get the sum.
The sum is complemented.
If the result is zero, the data are accepted:
otherwise, they are rejected.

Performance
The checksum detects all errors involving an
odd number of bits.
It detects most errors involving an even number
of bits.
If one or more bits of a segment are damaged
and the corresponding bit or bits of opposite
value in a second segment are also damaged, the
sums of those columns will not change and the
receiver will not detect a problem.

Error Correction
It can be handled in two ways:
1) receiver can have the sender retransmit the
entire data unit.
2) The receiver can use an error-correcting
code, which automatically corrects certain
errors.

Single-bit error correction
To correct an error, the receiver reverses the value
of the altered bit. To do so, it must know which bit
is in error.
Number of redundancy bits needed
• Let data bits = m
• Redundancy bits = r
Total message sent = m+r
The value of r must satisfy the following relation:
2r ≥ m+r+1

Error control techniques allow for detection and correction of errors during data transmission. Error control is implemented at the data link layer using automatic repeat request (ARQ) protocols like stop-and-wait and sliding window. Stop-and-wait involves transmitting a single frame and waiting for an acknowledgment before sending the next frame. Sliding window protocols allow multiple unacknowledged frames to be transmitted by using frame numbers and acknowledging receipt of frames. These protocols detect errors when frames are received out of sequence and trigger retransmission of lost frames.

Wireless transmissionRajapriya82

Presentation on cyclic redundancy check (crc)Sudhanshu Srivastava

Error Detection and correction concepts in Data communication and networksNt Arvind

Error detection and correctionAbdul Razaq

Routing algorithmsParameswaran Selvakumar

Congestion controlAman Jaiswal

The document discusses congestion control in computer networks. It defines congestion as occurring when the load on a network is greater than the network's capacity. Congestion control aims to control congestion and keep the load below capacity. The document outlines two categories of congestion control: open-loop control, which aims to prevent congestion; and closed-loop control, which detects congestion and takes corrective action using feedback from the network. Specific open-loop techniques discussed include admission control, traffic shaping using leaky bucket and token bucket algorithms, and traffic scheduling.

MultiplexingNeeraj Garwal

Network layer tanenbaumMahesh Kumar Chelimilla

This document provides an overview of key concepts in network layer design, including: - Store-and-forward packet switching and the services provided to the transport layer. - Implementation of connectionless and connection-oriented services, and comparison of virtual circuits and datagrams. - Routing algorithms like shortest path, flooding, distance vector, link state, and hierarchical routing. - Quality of service techniques including integrated services, differentiated services, and MPLS. - Internetworking issues such as connecting different networks, concatenated virtual circuits, tunneling, and fragmentation. - An overview of the network layer in the Internet including IP, addressing, routing protocols like OSPF and BGP, and

Error Detection And CorrectionRenu Kewalramani

The document discusses error detection and correction techniques used in data communication. It describes different types of errors like single bit errors and burst errors. It then explains various error detection techniques like vertical redundancy check (VRC), longitudinal redundancy check (LRC), and cyclic redundancy check (CRC). VRC adds a parity bit, LRC calculates parity bits for each column, and CRC uses a generator polynomial to calculate redundant bits. The document also discusses Hamming code, an error correcting code that uses redundant bits to detect and correct single bit errors.

Routing algorithmBushra M

The network layer is responsible for routing packets from the source to destination. The routing algorithm is the piece of software that decides where a packet goes next (e.g., which output line, or which node on a broadcast channel).For connectionless networks, the routing decision is made for each datagram. For connection-oriented networks, the decision is made once, at circuit setup time. Routing Issues The routing algorithm must deal with the following issues: Correctness and simplicity: networks are never taken down; individual parts (e.g., links, routers) may fail, but the whole network should not. Stability: if a link or router fails, how much time elapses before the remaining routers recognize the topology change? (Some never do..) Fairness and optimality: an inherently intractable problem. Definition of optimality usually doesn't consider fairness. Do we want to maximize channel usage? Minimize average delay? When we look at routing in detail, we'll consider both adaptive--those that take current traffic and topology into consideration--and nonadaptive algorithms.

Network Layer design Issues.pptxAcad

The network layer provides two main services: connectionless and connection-oriented. Connectionless service routes packets independently through routers using destination addresses and routing tables. Connection-oriented service establishes a virtual circuit between source and destination, routing all related traffic along the pre-determined path. The document also discusses store-and-forward packet switching, where packets are stored until fully received before being forwarded, and services provided to the transport layer like uniform addressing.

Error controlselvakumar_b1985

This document discusses different types of errors that can occur during data transmission and various error detection and correction techniques. It describes single-bit errors where one bit is changed and burst errors where multiple consecutive bits are changed. It then explains techniques like two-dimensional parity, checksums, and cyclic redundancy checks which add redundant bits to detect errors by checking for discrepancies between transmitted and received data. The document provides examples of how internet checksums and cyclic redundancy checks work to detect errors.

Computer network switchingShivani Godha

This document discusses different types of computer network switching, including circuit switching, packet switching, and virtual circuit switching. Circuit switching establishes a dedicated connection between nodes for the duration of a call. Packet switching divides messages into packets that are routed independently through a network on a first-come, first-served basis without dedicated connections. Virtual circuit switching combines aspects of circuit switching and packet switching by establishing paths for packets through a three-phase process of setup, data transfer using local addressing, and teardown.

Transmission ImpairmentTaaanu01

Network Layer,Computer Networksguesta81d4b

The document discusses the network layer in computer networking. It describes how the network layer is responsible for routing packets from their source to destination. It covers different routing algorithms like distance vector routing and link state routing. It also compares connectionless and connection-oriented services, as well as datagram and virtual circuit subnets. Key aspects of routing algorithms like optimality, stability, and fairness are defined.

Multiple Access Protocaltes31

Fast Ethernet increased the bandwidth of standard Ethernet from 10 Mbps to 100 Mbps. It used the same CSMA/CD access method and frame format as standard Ethernet but with some changes to address the higher speed. Fast Ethernet was implemented over twisted pair cables using 100BASE-TX or over fiber optic cables using 100BASE-FX. The increased speed enabled Fast Ethernet to compete with other high-speed LAN technologies of the time like FDDI.

Network layer - design Issuesقصي نسور

Input output organizationabdulugc

The document discusses various aspects of I/O organization in a computer system. It describes the input-output interface that provides a method for transferring information between internal storage and external I/O devices. It discusses asynchronous data transfer techniques like strobe control and handshaking. It also covers asynchronous serial transmission, different modes of data transfer like programmed I/O, interrupt-initiated I/O, and direct memory access (DMA).

remote procedure callsAshish Kumar

Remote Procedure Calls (RPC) allow a program to execute a procedure in another address space without needing to know where it is located. RPC uses client and server stubs that conceal the underlying message passing between client and server processes. The client stub packs the procedure call into a message and sends it to the server stub, which unpacks it and executes the procedure before returning any results. This makes remote procedure calls appear as local procedure calls to improve transparency. IDL is used to define interfaces and generate client/server stubs automatically to simplify development of distributed applications using RPC.

Unit 3 Network Layer PPTKalpanaC14

The document discusses network layer concepts including packet switching, IP addressing, and fragmentation. It provides details on: - Packet switching breaks data into packets that are routed independently and reassembled at the destination. This allows for more efficient use of bandwidth compared to circuit switching. - IP addresses in IPv4 are 32-bit numbers that identify devices on the network. Addresses are expressed in decimal notation like 192.168.1.1. Fragmentation breaks packets larger than the MTU into smaller fragments for transmission.

Mining single dimensional boolean association rules from transactionalramya marichamy

The document discusses mining frequent itemsets and generating association rules from transactional databases. It introduces the Apriori algorithm, which uses a candidate generation-and-test approach to iteratively find frequent itemsets. Several improvements to Apriori's efficiency are also presented, such as hashing techniques, transaction reduction, and approaches that avoid candidate generation like FP-trees. The document concludes by discussing how Apriori can be applied to answer iceberg queries, a common operation in market basket analysis.

Introduction to Multiple Access Protocol.pptxupamatechverse

Computer architecture data representationAnil Pokhrel

This document discusses various methods of data representation in digital systems, including number systems, data types, and encoding of numeric values. It covers binary, decimal, and floating point representation, as well as techniques for representing negative numbers like signed magnitude, 1's complement, and 2's complement. Error detection codes like parity bits are also introduced as a way to detect errors during data transmission. Key topics include binary conversion of decimal numbers, floating point representation using mantissa and exponent, overflow detection, and even/odd parity generation.

Issues in Data Link Layerselvakumar_b1985

Query processingDr. C.V. Suresh Babu

Block coding, error detection (Parity checking, Cyclic redundancy checking (C...Paulo_Vangui

The document discusses several techniques for error detection in digital communications, including block coding, parity checking, cyclic redundancy checks (CRC), and Hamming codes. Block coding involves dividing a message into blocks of k bits and adding r redundant bits to each block. Parity checking adds an extra bit to detect errors by checking if the number of 1's is even or odd. CRC generates a frame check sequence such that the data block and sequence are divisible by a predetermined number to detect errors. Hamming codes add k parity bits to an n-bit data word to detect and sometimes correct errors. These techniques help detect errors caused by interference during transmission but cannot always determine the location or correct multiple errors.

Error detection.pptPawanRaj48

This document discusses error detection and correction in data transmission. It explains that networks must transfer data accurately and that errors can occur during transmission. It then describes different types of errors like single-bit errors and burst errors. It also discusses various techniques for error detection using redundancy like vertical redundancy check, longitudinal redundancy check, cyclic redundancy check, and checksums. Finally, it covers error correction methods like having the sender retransmit data or using error-correcting codes like Hamming codes to automatically correct certain errors.

error detection.pptJayaprasanna4

This document discusses error detection and correction techniques used in data communication. It describes different types of errors like single-bit errors and burst errors. It then explains various error detection methods like vertical redundancy check (VRC), longitudinal redundancy check (LRC), cyclic redundancy check (CRC), and checksum that work by adding redundant bits. The document also covers error correction techniques like single-bit error correction using Hamming code which allows detecting and correcting single-bit errors.

More Related Content

What's hot (20)

MultiplexingNeeraj Garwal

Network layer tanenbaumMahesh Kumar Chelimilla

Error Detection And CorrectionRenu Kewalramani

Routing algorithmBushra M

Network Layer design Issues.pptxAcad

Error controlselvakumar_b1985

Computer network switchingShivani Godha

Transmission ImpairmentTaaanu01

Network Layer,Computer Networksguesta81d4b

Multiple Access Protocaltes31

Network layer - design Issuesقصي نسور

Input output organizationabdulugc

remote procedure callsAshish Kumar

Unit 3 Network Layer PPTKalpanaC14

Mining single dimensional boolean association rules from transactionalramya marichamy

Introduction to Multiple Access Protocol.pptxupamatechverse

Computer architecture data representationAnil Pokhrel

Issues in Data Link Layerselvakumar_b1985

Query processingDr. C.V. Suresh Babu

Block coding, error detection (Parity checking, Cyclic redundancy checking (C...Paulo_Vangui

MultiplexingNeeraj Garwal

Network layer tanenbaumMahesh Kumar Chelimilla

Error Detection And CorrectionRenu Kewalramani

Routing algorithmBushra M

Network Layer design Issues.pptxAcad

Error controlselvakumar_b1985

Computer network switchingShivani Godha

Transmission ImpairmentTaaanu01

Network Layer,Computer Networksguesta81d4b

Multiple Access Protocaltes31

Network layer - design Issuesقصي نسور

Input output organizationabdulugc

remote procedure callsAshish Kumar

Unit 3 Network Layer PPTKalpanaC14

Mining single dimensional boolean association rules from transactionalramya marichamy

Introduction to Multiple Access Protocol.pptxupamatechverse

Computer architecture data representationAnil Pokhrel

Issues in Data Link Layerselvakumar_b1985

Query processingDr. C.V. Suresh Babu

Block coding, error detection (Parity checking, Cyclic redundancy checking (C...Paulo_Vangui

Similar to computer Networks Error Detection and Correction.ppt (20)

Error detection.pptPawanRaj48

error detection.pptJayaprasanna4

Error correction error detection in digital communicationswatihalunde

This document discusses error detection and correction techniques. It describes different types of errors like single-bit errors and burst errors. It then explains various error detection methods like vertical redundancy check (VRC), longitudinal redundancy check (LRC), cyclic redundancy check (CRC), and checksum that work by adding redundant bits. CRC is more powerful than VRC and LRC as it can detect all single and some multiple bit errors. The document also covers error correction techniques like single-bit error correction using Hamming code that allows detecting and correcting single bit errors.

901325_chapter 10 (1).pptBezaAlem2

This document discusses error detection and correction techniques used in data transmission. It describes different types of errors like single-bit errors and burst errors. It then explains various error detection methods like vertical redundancy check (VRC), longitudinal redundancy check (LRC), cyclic redundancy check (CRC) and checksum that detect errors by adding redundant bits. CRC uses polynomial division to detect errors while checksum adds all data bits. Finally, it discusses single-bit error correction using Hamming code, which embeds location information of parity bits to identify and correct single-bit errors.

Error Detection and Correction.pptKumarVaibhav100

This document discusses error detection and correction techniques used in data transmission. It describes different types of errors like single-bit errors and burst errors. It then explains various error detection methods like vertical redundancy check (VRC), longitudinal redundancy check (LRC), cyclic redundancy check (CRC) and checksum that detect errors by adding redundant bits. CRC uses polynomial division to detect errors while checksum adds all data bits. Finally, it discusses Hamming code, which allows detection and correction of single-bit errors by adding even more redundant bits in a specific way.

Error detection and correction.pptMsSJeyalakshmiVelsUn

901325_chapter vvvvvvvvvvvjjjjjjjvvv.pptSofienBoutaib

Error correction and detection thShardaSalunkhe1

This document discusses error detection and correction techniques used in digital communications. It describes how errors can occur during data transmission and why error detection and correction is needed. It then explains different types of errors and various error detection techniques like parity checks, checksums, and cyclic redundancy checks. Finally, it discusses error correction techniques like backward error correction using retransmissions and forward error correction using redundant bits and provides an example of Hamming codes.

اسس شبكات الفصل الثاني اسسس الشبكات الفصل الثاني.fma561793

Data link layerIndrajaMeghavathula

The data link layer is responsible for node-to-node communication over a physical link. Its main responsibilities include frame synchronization, flow control, error control, addressing, and link management. Error detection and correction are important functions, with various coding schemes using redundancy to detect or correct corrupted bits during transmission. Common techniques include forward error correction, retransmission, block coding, and error detection codes like parity checks and CRC.

Error correction and Detection technique while sending the messageAnil Kumar Sonkar Sonkar

Lecture 13Anwal Mirza

This document discusses error detection and correction techniques used in computer networks. It describes several methods: - Vertical redundancy check (VRC or parity check) which detects single-bit errors by adding an extra parity bit to each data unit. - Longitudinal redundancy check (LRC) which calculates parity bits for each column in a data block. - Cyclic redundancy check (CRC) which uses binary division to generate a CRC remainder that is appended to the data. - Checksum which calculates a sum of all data bits and appends the one's complement as a checksum. These methods allow detection of errors during data transmission.

Error detection and correctionSisir Ghosh

Error coding uses mathematical formulas to encode data bits into longer code words for transmission. This allows errors caused by environmental interference to be detected and sometimes corrected at the destination. There are two main types of error coding: error-detecting codes and error-correcting codes. Error-detecting codes add enough redundancy to allow errors to be detected but not corrected, while error-correcting codes add more redundancy to allow errors to be corrected. Common error-detecting coding techniques include parity checks, checksums, and cyclic redundancy checks (CRCs). These techniques use additional redundant bits appended to the data to facilitate error detection. CRC is particularly powerful as it can detect all single-bit errors and many burst errors.

computer network-unit 2sharmilas38

Computer Networks - Error Detection and Correctionvijayalakshmis184431

COMPUTER NETWORKS UNIT 2BON SECOURS COLLEGE FOR WOMEN

The document summarizes key aspects of the data link layer: - It is responsible for frame transmission and error detection/correction between directly connected hosts. - It has two sublayers: logical link control for flow/error control and media access control for media access. - Functions include framing, addressing, synchronization, error detection/correction, and flow control. Common error detection techniques are parity checks and cyclic redundancy checks.

data link layer - Chapter 3SakthiVinoth78

Saksuhail ahmad

This presentation discusses error detection in computer networks. It describes three main types of errors: single-bit errors, frame errors with more than one bit corrupted, and burst errors where two or more consecutive bits are corrupted. It then explains three common error detection methods: parity check, cyclic redundancy check (CRC), and checksum. Parity check adds an extra bit to make the total number of 1s either even or odd. CRC uses a polynomial-based binary division method. Checksum counts the number of bits and includes the count for verification.

computer networks Error Detection Methods.pdfBalasubramanian699229

- Errors can be single bit or burst, affecting multiple bits. Three common redundancy check methods are vertical redundancy check (VRC), longitudinal redundancy check (LRC), and cyclic redundancy check (CRC). - VRC adds a parity bit to the data unit to detect single bit and odd-length burst errors. LRC organizes data into a table and calculates a parity bit for each column. CRC performs binary division of the data unit using a predetermined divisor and appends the remainder as redundant bits. - CRC can detect all burst errors affecting an odd number of bits and has a very high probability of detecting longer bursts. It is the most powerful detection method using a generator to create redundant bits appended to the data and

III_UNIT_ErrorCorrecting.pptxShantanuDharekar

This document provides an overview of data link layer concepts including error control, flow control, error detection, error correction, and elementary data link protocols. It discusses the purposes and examples of error control using ARQ, flow control to prevent receiver overload, and various error detection techniques like parity checks, checksums, and cyclic redundancy checks (CRCs). Error correction codes are also introduced for detecting and correcting errors using additional redundant bits. Common data link protocols like stop-and-wait and sliding window protocols are listed for discussion in the course.

Error detection.pptPawanRaj48

error detection.pptJayaprasanna4

Error correction error detection in digital communicationswatihalunde

901325_chapter 10 (1).pptBezaAlem2

Error Detection and Correction.pptKumarVaibhav100

Error detection and correction.pptMsSJeyalakshmiVelsUn

901325_chapter vvvvvvvvvvvjjjjjjjvvv.pptSofienBoutaib

Error correction and detection thShardaSalunkhe1

اسس شبكات الفصل الثاني اسسس الشبكات الفصل الثاني.fma561793

Data link layerIndrajaMeghavathula

Error correction and Detection technique while sending the messageAnil Kumar Sonkar Sonkar

Lecture 13Anwal Mirza

Error detection and correctionSisir Ghosh

computer network-unit 2sharmilas38

Computer Networks - Error Detection and Correctionvijayalakshmis184431

COMPUTER NETWORKS UNIT 2BON SECOURS COLLEGE FOR WOMEN

data link layer - Chapter 3SakthiVinoth78

Saksuhail ahmad

computer networks Error Detection Methods.pdfBalasubramanian699229

III_UNIT_ErrorCorrecting.pptxShantanuDharekar

More from Jayaprasanna4 (20)

web programming javascriptconditionalstatements.pdfJayaprasanna4

hyper text markup language ppt-100605011058-phpapp02.pdfJayaprasanna4

web essentials - simple message flow and loo.pptxJayaprasanna4

web essentials - Working principle of a Website.pptxJayaprasanna4

software project in MONTE CARLO SIMULATION.pptxJayaprasanna4

Cost effort in softwrae project management.pptJayaprasanna4

software project management cocomomodel.pdfJayaprasanna4

software project management Activity planning.pptJayaprasanna4

software project management montecarloscheduleanalysis.pdfJayaprasanna4

casestudy on distributionnetworkformichaelshardwaregroupgate.pptJayaprasanna4

ethical hacking-mobile hacking methods.pptJayaprasanna4

ethical hacking in wireless-hacking1.pptJayaprasanna4

Human computer Interaction ch1-the human.pdfJayaprasanna4

Human cognition and perception involve receiving sensory input, processing and storing information, and applying it through reasoning, problem-solving and skill. The key senses are vision, hearing, touch, smell and taste. Vision involves light being focused on the retina and processed in the brain to interpret signals about size, depth, brightness and color. Hearing detects sound waves that are processed to identify pitch, loudness and timbre. Memory has three types - sensory, short-term and long-term. Thinking uses reasoning like deduction and induction, and problem-solving applies knowledge through means-ends analysis or analogy. Emotion influences human capabilities and involves both cognitive and physiological responses.

HUman computer Interaction Socio-organizational Issues.pptJayaprasanna4

This document discusses socio-organizational issues and stakeholder requirements in systems design. It covers topics such as organizational conflicts that can impact system acceptance, identifying stakeholder needs in context, and socio-technical models to understand human and technical requirements. Methodologies covered include soft systems methodology to take a broader view, participatory design to involve users, and ethnographic research to study users unbiasedly.

human computer Interaction cognitive models.pptJayaprasanna4

This document discusses cognitive models used to represent users of interactive systems. It describes hierarchical models that represent a user's task and goal structure, as well as linguistic models that represent the user-system grammar. GOMS and CCT are two common cognitive models discussed in detail, with both modeling a user's goals, operators, and methods in a hierarchical structure. The document also covers Keystroke-Level Modeling (KLM) which uses cognitive understandings to predict user performance times for simple tasks.

World wide web and Hyper Text Markup LanguageJayaprasanna4

The document discusses hypertext, multimedia, and the World Wide Web. It covers understanding hypertext and how it differs from linear text through its non-linear structure and links. It also discusses finding information on the web through navigation, structure, bookmarks and search engines. Finally, it outlines some of the underlying web technologies including protocols, servers, clients and networking that allow information to be delivered and accessed on the internet.

CI-Monte-Carlo.pptJayaprasanna4

The Monte Carlo method uses randomness to solve deterministic problems. It relies on the law of large numbers, which states that averaging a large number of random samples approximates the expected value. The method involves: 1) Defining a probability space with many random points; 2) Applying the constraints of the problem; 3) Discriminating between points inside and outside the constraints; 4) Using the internal points to define the solution space. The more points used, the more accurate the simulation.

Activity planning.pptJayaprasanna4

The document discusses activity planning for projects. It covers estimating activity durations, developing detailed activity schedules, and identifying risks. A project consists of related activities, and finishes when all activities are complete. Activities must have clear start and end points and estimated durations. Network diagrams like CPM and PERT are used to plan activity sequences and identify the critical path, which determines the overall project duration. Slack time and floats help schedule activities and identify scheduling flexibility.

Cost effort.pptJayaprasanna4

The document discusses various techniques for estimating software effort, including parametric models, expert judgment, analogy, and bottom-up and top-down approaches. It describes the bottom-up approach as breaking a project into tasks, estimating effort for each, and summing totals. Top-down uses parametric models relating effort to system size and productivity factors. Function point analysis and COSMIC function points are presented as top-down methods to measure system size independently of programming language.

Activity planning.pptJayaprasanna4

web programming javascriptconditionalstatements.pdfJayaprasanna4

hyper text markup language ppt-100605011058-phpapp02.pdfJayaprasanna4

web essentials - simple message flow and loo.pptxJayaprasanna4

web essentials - Working principle of a Website.pptxJayaprasanna4

software project in MONTE CARLO SIMULATION.pptxJayaprasanna4

Cost effort in softwrae project management.pptJayaprasanna4

software project management cocomomodel.pdfJayaprasanna4

software project management Activity planning.pptJayaprasanna4

software project management montecarloscheduleanalysis.pdfJayaprasanna4

casestudy on distributionnetworkformichaelshardwaregroupgate.pptJayaprasanna4

ethical hacking-mobile hacking methods.pptJayaprasanna4

ethical hacking in wireless-hacking1.pptJayaprasanna4

Human computer Interaction ch1-the human.pdfJayaprasanna4

HUman computer Interaction Socio-organizational Issues.pptJayaprasanna4

human computer Interaction cognitive models.pptJayaprasanna4

World wide web and Hyper Text Markup LanguageJayaprasanna4

CI-Monte-Carlo.pptJayaprasanna4

Activity planning.pptJayaprasanna4

Cost effort.pptJayaprasanna4

Activity planning.pptJayaprasanna4

Recently uploaded (20)

RICS Membership-(The Royal Institution of Chartered Surveyors).pdfMohamedAbdelkader115

Data Structures_Introduction to algorithms.pptxRushaliDeshmukh2

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)

DSP and MV the Color image processing.pptHafizAhamed8

Data Structures_Searching and Sorting.pptxRushaliDeshmukh2

DATA-DRIVEN SHOULDER INVERSE KINEMATICS YoungBeom Kim1 , Byung-Ha Park1 , Kwa...charlesdick1345

ADVXAI IN MALWARE ANALYSIS FRAMEWORK: BALANCING EXPLAINABILITY WITH SECURITYijscai

With the increased use of Artificial Intelligence (AI) in malware analysis there is also an increased need to understand the decisions models make when identifying malicious artifacts. Explainable AI (XAI) becomes the answer to interpreting the decision-making process that AI malware analysis models use to determine malicious benign samples to gain trust that in a production environment, the system is able to catch malware. With any cyber innovation brings a new set of challenges and literature soon came out about XAI as a new attack vector. Adversarial XAI (AdvXAI) is a relatively new concept but with AI applications in many sectors, it is crucial to quickly respond to the attack surface that it creates. This paper seeks to conceptualize a theoretical framework focused on addressing AdvXAI in malware analysis in an effort to balance explainability with security. Following this framework, designing a machine with an AI malware detection and analysis model will ensure that it can effectively analyze malware, explain how it came to its decision, and be built securely to avoid adversarial attacks and manipulations. The framework focuses on choosing malware datasets to train the model, choosing the AI model, choosing an XAI technique, implementing AdvXAI defensive measures, and continually evaluating the model. This framework will significantly contribute to automated malware detection and XAI efforts allowing for secure systems that are resilient to adversarial attacks.

Structural Response of Reinforced Self-Compacting Concrete Deep Beam Using Fi...Journal of Soft Computing in Civil Engineering

Analysis of reinforced concrete deep beam is based on simplified approximate method due to the complexity of the exact analysis. The complexity is due to a number of parameters affecting its response. To evaluate some of this parameters, finite element study of the structural behavior of the reinforced self-compacting concrete deep beam was carried out using Abaqus finite element modeling tool. The model was validated against experimental data from the literature. The parametric effects of varied concrete compressive strength, vertical web reinforcement ratio and horizontal web reinforcement ratio on the beam were tested on eight (8) different specimens under four points loads. The results of the validation work showed good agreement with the experimental studies. The parametric study revealed that the concrete compressive strength most significantly influenced the specimens’ response with the average of 41.1% and 49 % increment in the diagonal cracking and ultimate load respectively due to doubling of concrete compressive strength. Although the increase in horizontal web reinforcement ratio from 0.31 % to 0.63 % lead to average of 6.24 % increment on the diagonal cracking load, it does not influence the ultimate strength and the load-deflection response of the beams. Similar variation in vertical web reinforcement ratio leads to an average of 2.4 % and 15 % increment in cracking and ultimate load respectively with no appreciable effect on the load-deflection response.

Artificial Intelligence (AI) basics.pptxaditichinar

"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.

Reagent dosing (Bredel) presentation.pptxAlejandroOdio

Process Parameter Optimization for Minimizing Springback in Cold Drawing Proc...Journal of Soft Computing in Civil Engineering

In tube drawing process, a tube is pulled out through a die and a plug to reduce its diameter and thickness as per the requirement. Dimensional accuracy of cold drawn tubes plays a vital role in the further quality of end products and controlling rejection in manufacturing processes of these end products. Springback phenomenon is the elastic strain recovery after removal of forming loads, causes geometrical inaccuracies in drawn tubes. Further, this leads to difficulty in achieving close dimensional tolerances. In the present work springback of EN 8 D tube material is studied for various cold drawing parameters. The process parameters in this work include die semi-angle, land width and drawing speed. The experimentation is done using Taguchi’s L36 orthogonal array, and then optimization is done in data analysis software Minitab 17. The results of ANOVA shows that 15 degrees die semi-angle,5 mm land width and 6 m/min drawing speed yields least springback. Furthermore, optimization algorithms named Particle Swarm Optimization (PSO), Simulated Annealing (SA) and Genetic Algorithm (GA) are applied which shows that 15 degrees die semi-angle, 10 mm land width and 8 m/min drawing speed results in minimal springback with almost 10.5 % improvement. Finally, the results of experimentation are validated with Finite Element Analysis technique using ANSYS.

Machine learning project on employee attrition detection using (2).pptxrajeswari89780

Compiler Design Unit1 PPT Phases of Compiler.pptxRushaliDeshmukh2

π0.5: a Vision-Language-Action Model with Open-World GeneralizationNABLAS株式会社

今回の資料「Transfusion / π0 / π0.5」は、画像・言語・アクションを統合するロボット基盤モデルについて紹介しています。拡散×自己回帰を融合したTransformerをベースに、π0.5ではオープンワールドでの推論・計画も可能に。 This presentation introduces robot foundation models that integrate vision, language, and action. Built on a Transformer combining diffusion and autoregression, π0.5 enables reasoning and planning in open-world settings.

"Boiler Feed Pump (BFP): Working, Applications, Advantages, and Limitations E...Infopitaara

A Boiler Feed Pump (BFP) is a critical component in thermal power plants. It supplies high-pressure water (feedwater) to the boiler, ensuring continuous steam generation. ⚙️ How a Boiler Feed Pump Works Water Collection: Feedwater is collected from the deaerator or feedwater tank. Pressurization: The pump increases water pressure using multiple impellers/stages in centrifugal types. Discharge to Boiler: Pressurized water is then supplied to the boiler drum or economizer section, depending on design. 🌀 Types of Boiler Feed Pumps Centrifugal Pumps (most common): Multistage for higher pressure. Used in large thermal power stations. Positive Displacement Pumps (less common): For smaller or specific applications. Precise flow control but less efficient for large volumes. 🛠️ Key Operations and Controls Recirculation Line: Protects the pump from overheating at low flow. Throttle Valve: Regulates flow based on boiler demand. Control System: Often automated via DCS/PLC for variable load conditions. Sealing & Cooling Systems: Prevent leakage and maintain pump health. ⚠️ Common BFP Issues Cavitation due to low NPSH (Net Positive Suction Head). Seal or bearing failure. Overheating from improper flow or recirculation.

Fort night presentation new0903 pdf.pdf.anuragmk56

211421893-M-Tech-CIVIL-Structural-Engineering-pdf.pdfinmishra17121973

Development of MLR, ANN and ANFIS Models for Estimation of PCUs at Different ...Journal of Soft Computing in Civil Engineering

Passenger car unit (PCU) of a vehicle type depends on vehicular characteristics, stream characteristics, roadway characteristics, environmental factors, climate conditions and control conditions. Keeping in view various factors affecting PCU, a model was developed taking a volume to capacity ratio and percentage share of particular vehicle type as independent parameters. A microscopic traffic simulation model VISSIM has been used in present study for generating traffic flow data which some time very difficult to obtain from field survey. A comparison study was carried out with the purpose of verifying when the adaptive neuro-fuzzy inference system (ANFIS), artificial neural network (ANN) and multiple linear regression (MLR) models are appropriate for prediction of PCUs of different vehicle types. From the results observed that ANFIS model estimates were closer to the corresponding simulated PCU values compared to MLR and ANN models. It is concluded that the ANFIS model showed greater potential in predicting PCUs from v/c ratio and proportional share for all type of vehicles whereas MLR and ANN models did not perform well.

Degree_of_Automation.pdf for Instrumentation and industrial specialistshreyabhosale19

AI-assisted Software Testing (3-hours tutorial)Vəhid Gəruslu

RICS Membership-(The Royal Institution of Chartered Surveyors).pdfMohamedAbdelkader115

Data Structures_Introduction to algorithms.pptxRushaliDeshmukh2

DSP and MV the Color image processing.pptHafizAhamed8

Data Structures_Searching and Sorting.pptxRushaliDeshmukh2

DATA-DRIVEN SHOULDER INVERSE KINEMATICS YoungBeom Kim1 , Byung-Ha Park1 , Kwa...charlesdick1345

ADVXAI IN MALWARE ANALYSIS FRAMEWORK: BALANCING EXPLAINABILITY WITH SECURITYijscai

Structural Response of Reinforced Self-Compacting Concrete Deep Beam Using Fi...Journal of Soft Computing in Civil Engineering

Artificial Intelligence (AI) basics.pptxaditichinar

"Feed Water Heaters in Thermal Power Plants: Types, Working, and Efficiency G...Infopitaara

Reagent dosing (Bredel) presentation.pptxAlejandroOdio

Process Parameter Optimization for Minimizing Springback in Cold Drawing Proc...Journal of Soft Computing in Civil Engineering

Machine learning project on employee attrition detection using (2).pptxrajeswari89780

Compiler Design Unit1 PPT Phases of Compiler.pptxRushaliDeshmukh2

π0.5: a Vision-Language-Action Model with Open-World GeneralizationNABLAS株式会社

"Boiler Feed Pump (BFP): Working, Applications, Advantages, and Limitations E...Infopitaara

Fort night presentation new0903 pdf.pdf.anuragmk56

211421893-M-Tech-CIVIL-Structural-Engineering-pdf.pdfinmishra17121973

Development of MLR, ANN and ANFIS Models for Estimation of PCUs at Different ...Journal of Soft Computing in Civil Engineering

Degree_of_Automation.pdf for Instrumentation and industrial specialistshreyabhosale19

AI-assisted Software Testing (3-hours tutorial)Vəhid Gəruslu

computer Networks Error Detection and Correction.ppt

1. Error Detection and Correction • Types of Errors • Detection • Correction

2. Basic concepts  Networks must be able to transfer data from one device to another with complete accuracy.  Data can be corrupted during transmission.  For reliable communication, errors must be detected and corrected.  Error detection and correction are implemented either at the data link layer or the transport layer of the OSI model.

3. Types of Errors

4. Single-bit error

5. Single bit errors are the least likely type of errors in serial data transmission because the noise must have a very short duration which is very rare. However this kind of errors can happen in parallel transmission.

6. Burst error

8. The term burst error means that two or more bits in the data unit have changed from 1 to 0 or from 0 to 1. Burst errors does not necessarily mean that the errors occur in consecutive bits, the length of the burst is measured from the first corrupted bit to the last corrupted bit. Some bits in between may not have been corrupted.

9. Burst error is most likely to happen in serial transmission since the duration of noise is normally longer than the duration of a bit. The number of bits affected depends on the data rate and duration of noise.

10. Error detection Error detection means to decide whether the received data is correct or not without having a copy of the original message. Error detection uses the concept of redundancy, which means adding extra bits for detecting errors at the destination.

11. Redundancy

12. Four types of redundancy checks are used in data communications

13. Vertical Redundancy Check VRC

14. Performance It can detect single bit error It can detect burst errors only if the total number of errors is odd.

15. Longitudinal Redundancy Check LRC

16. Performance LCR increases the likelihood of detecting burst errors. If two bits in one data units are damaged and two bits in exactly the same positions in another data unit are also damaged, the LRC checker will not detect an error.

17. VRC and LRC

18. Cyclic Redundancy Check CRC

19. Cyclic Redundancy Check • Given a k-bit frame or message, the transmitter generates an n-bit sequence, known as a frame check sequence (FCS), so that the resulting frame, consisting of (k+n) bits, is exactly divisible by some predetermined number. • The receiver then divides the incoming frame by the same number and, if there is no remainder, assumes that there was no error.

20. Binary Division

21. Polynomial

22. Polynomial and Divisor

23. Standard Polynomials

24. Checksum

25. At the sender The unit is divided into k sections, each of n bits. All sections are added together using one’s complement to get the sum. The sum is complemented and becomes the checksum. The checksum is sent with the data

26. At the receiver The unit is divided into k sections, each of n bits. All sections are added together using one’s complement to get the sum. The sum is complemented. If the result is zero, the data are accepted: otherwise, they are rejected.

27. Performance The checksum detects all errors involving an odd number of bits. It detects most errors involving an even number of bits. If one or more bits of a segment are damaged and the corresponding bit or bits of opposite value in a second segment are also damaged, the sums of those columns will not change and the receiver will not detect a problem.

28. Error Correction It can be handled in two ways: 1) receiver can have the sender retransmit the entire data unit. 2) The receiver can use an error-correcting code, which automatically corrects certain errors.

29. Single-bit error correction To correct an error, the receiver reverses the value of the altered bit. To do so, it must know which bit is in error. Number of redundancy bits needed • Let data bits = m • Redundancy bits = r Total message sent = m+r The value of r must satisfy the following relation: 2r ≥ m+r+1

30. Error Correction

31. Hamming Code

32. Hamming Code

33. Hamming Code

34. Example of Hamming Code

35. Single-bit error

36. Error Detection