





Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
The application of Obligation Tree Analysis in electrical engineering for reliability evaluation. The document emphasizes the importance of data structures in representing obligation trees and reducing computation time. Topics covered include the construction of obligation trees, representation using data structures, extraction of minimal cut-sets, and calculation of system reliability. The document also mentions linked list processing and power system reliability metrics such as Loss of Load Probability (LOLP) index and Loss of Power index.
What you will learn
Typology: Slides
1 / 9
This page cannot be seen from the preview
Don't miss anything!
With the rising intricacy of manipulation arrangement configuration, the computation of reliability becomes quite monotonous after one possesses to deal alongside a non- series- parallel system. There possesses been a tolerating and rising attention in methods for manipulation arrangement reliability evaluation. In the reliability scutiny of convoluted arrangements, an usual way is to delineate the physical arrangement by way of a little logic diagram that expresses all useful relations amid constituents or events believed to be elemental. Countless methods are obtainable for assessing manipulation arrangement reliability. The enthusing methods that had by nowadays been derived contain Heuristic methods, Simulation methods, Negligible cut-set methods and Obligation tree techniques.
Even nevertheless countless methods are obtainable to embody the obligation tree extra effectually in a computer that cut the computing period for the procedures that possess to be gave alongside the obligation tree, the believed of data structures in representing the obligation trees possesses decreased the computing period drastically. The main motivation of this algorithm is to attain the negligible cut-sets as swiftly as probable alongside the custom of the smallest number of main core memory. Specifically, the main goals of this paper work are methodical as follows: I. Construction of obligation tree by pondering all arrangement wreck events. ii. Representing the above crafted obligation tree extra efficiently and effectually (using data structures). iii. Extraction of negligible cut-sets from the above embodied obligation tree. iv. Calculation of finished arrangement reliability by substituting the wreck data on main or frank events. v. To apply parallel algorithm to cut the computing time.
After employing related catalog to embody a tree construction, it is vital for two pointers to be associated alongside every single node of the tree. The early pointer indicates the early youngster of the node, i.e., the left most youngster, the subsequent pointer indicates the attendance of a youngster of the alike parent, i.e., a twin pointer. The insertion and deletion of nodes does not need the rewriting of the nodes records as is the case alongside sequential tabulating of a tree. One more supremacy of the related catalog construction above a sequential catalog is that it is probable to admission a node lacking possessing to bypass across every single node in the tree. The steps encompassed in representing a web in the form of related catalog are as follows: i. Access a origin node of the network. ii. Store the origin node data. iii. Traverse the sub-tree to admission the youngster nodes of the origin node. iv.At every single youngster node, store the node data, set a origin pointer to the youngster node data and set a youngster node pointer to the origin node data. v. Go to pace i unless all the origin nodes on the web possess been accessed.
: LOLP method is retained in reliability studies of mechanical manipulation arrangements to assess the probability that the arrangement burden could exceed the obtainable producing capacity. LOLP can be described as the probability of the arrangement burden exceeding the obtainable producing capacity below the assumption that the top burden of every single date lasts all day. When the reliability of an mechanical manipulation arrangement is assessed by the LOLP method, it is customary to seize into report the uncertainty in the burden forecasts by associating a peak-load allocation alongside the consented daily peak-load period curve.
Loss of power index: : In place of LOLP index, one more reliability compute (Loss of Power Index) can be utilized for a producing arrangement i.e., the ratio of the anticipated number of power not supplied across a little long era of observation to the finished power needed across the a like period. In a little method, the loss-of-energy index possesses extra physical meaning than the LOLP index. It is an ‘in-depth’ computes of reliability in that it will accept higher benefits for extra weighty events than for marginal wrecks even if their probabilities and frequencies are the same. On the supplementary hand, the real defeat of power cannot be precisely computed on the basis of the cumulative arc of daily peaks. For this reason, the loss-of-energy index is rarely used. Though, defeats of power are ambitious, employing suitable burden models, in countless creation price evaluation programs.