A5073851124- Reliability and Maintenance Optimization
- Software Reliability and Analysis Research
- Risk and Safety Analysis
- Probabilistic and Robust Engineering Design
- Power System Reliability and Maintenance
- Optimization and Packing Problems
- Metal complexes synthesis and properties
- Power System Optimization and Stability
- Optimal Power Flow Distribution
- Fault Detection and Control Systems
- Advanced Control Systems Optimization
- Statistical Distribution Estimation and Applications
- Ferrocene Chemistry and Applications
- Advanced Data Processing Techniques
- Engineering Diagnostics and Reliability
- Software System Performance and Reliability
- Manufacturing Process and Optimization
- Multi-Criteria Decision Making
- Microgrid Control and Optimization
- Advanced Optimization Algorithms Research
- Smart Grid Security and Resilience
- Lanthanide and Transition Metal Complexes
- Advanced Manufacturing and Logistics Optimization
- Graph Theory and Algorithms
- Protein Interaction Studies and Fluorescence Analysis
National Institute of Technology Durgapur
2013-2021
Indian Institute of Technology Kharagpur
1983-2002
Indian Institute of Technology Indore
1985-2001
North Eastern Regional Institute of Science and Technology
1996
Indian Institute of Technology Roorkee
1973-1982
Kurukshetra University
1974
Ludwig-Maximilians-Universität München
1972
Very few techniques exist for reliability evaluation of communication systems where links as well nodes have certain probability failure. This correspondence describes a technique by which the expression such system can be conveniently derived. It is also shown that using concept this correspondence, it possible to extend all existing reliability-evaluation algorithms with little effort.
A simple and efficient technique for solving integer-programming problems that normally arise in system-reliability design is introduced. It quickly solves even a very large system problem. consists of systematic search near the boundary constraints involves functional evaluations only. can handle any type which decision variables are restricted to integer values. Several illustrative examples given substantiate these assertions.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML"...
An algorithm is developed to obtain a simplified reliability expression for general network. All the success paths of network are determined; then they modified be mutually disjoint. The follows directly from disjoint paths. easy and computationally economical. involves fewer terms arithmetic operations than any existing methods. This an advantage, considering size system engineer normally handles frequency with which used studies.
An algorithm is presented for evaluation of reliability any redundant network. It uses the properties digraphs and especially suitable computer analysis large complex networks. A method deriving expression type network also described along with a Fortran program series-parallel
A flow graph approach for reliability analysis is applied to redundancy with elements in the simple series-parallel networks and more general case non-series-parallel combinations. The of open or short failures analyzed graphs. Typical examples are shown.
An algorithm for the heuristic solution of redundancy optimization problems is presented. There may be any number constraints which need not linear. For selecting stage where to added, a criterion introduced takes into account relative increment in reliability versus decrement slacks. The simple and requires minimum computation.
The redundancy optimization problem is formulated as an integer programming of zero-one type variables. solution obtained making use algorithm due to Lawler and Bell. Objective function constraints can be any arbitrary functions. Three different variations the are considered. formulation easy convenient on a digital computer. size that solved not restricted by number constraints.
This paper provides a simple algorithm for the solution of redundancy optimization problem in presence multiple linear constraints. Basicaily, to an r-constraint is obtained successively from r-unconstrained problems. At each step, active constraint picked out, then maximum gradient concept used find closer point. The approach requires minimum effort and time solution.
Summary Dynamic programming formulation for obtaining the optimum number of redundancies at each stage in a system is explained detail. It also emphasized and illustrated by examples, that 'summation' form functional equations, as suggested paper, provide faster solution to an otherwise computationally voluminous method.
Reliability evaluation of a large and complex system is quite an involved time-consuming process its state-of-art far from being called as satisfactory. This mainly due to the fact that unionizing path sets results in number terms reliability expression. Thereafter, computing numerical value expression task not free build up round-off errors. The entire also restricts use low-end PC for such systems. In this paper, we propose efficient methodology evaluate systems based on minimal sets;...
This paper presents a method for optimal load curtailment in power system taking into account of generator control effects and voltage frequency characteristics loads. The optimization problem is solved by second-order gradient technique. Rigorous formulation inclusion all security related constraints assures that the solution always represents secure system. It shown speed can be increased approximating matrix using complementary Davidon-Fletcher-Powell update. illustrated on alO-bus II=...
The method of Lee and the simple application graph theory seem to give different answers for flow networks. Lee's is correct. whereby can be extended correct results explained.
In this paper, we propose a hybrid method to evaluate reliability of large and complex networks that incorporates the best features earlier techniques such as KDH88 CAREL. The present combines CAREL’s COMpare REDuce operators along with eliminates use other two CAREL, thus resulting in an extensive reduction number exclusive mutually disjoint terms. procedure not only saves CPU time by appreciable amount but also can be run even on low‐end PC. To demonstrate advantage handling system...
A nuclear power plant generally consists of subsystems that may employ any the partial, standby and active redundancies. The design such a mixed redundancy system under some techno-economic constraints, is quite important in order to achieve specific objectives. Often objective maximize reliability given constraints (mainly cost constraint). In present paper an algorithm described which makes solution this mathematically difficult problem possible. has been found powerful efficient solve...
Third order kinetics of bio-relevant thiols and thio-ether with dinuclear Pd(<sc>ii</sc>) complex possessing anticancer antibacterial properties.
Abstract A complex system of s-dependent and s-independent units is considered in this paper for reliability evaluation. It also assumed that failure any unit the dependent set increases probabilities remainder set. general ease partial redundant subsystems considered. computational algorithm to compute effective rates remaining components which fail sequentially, explained programme implementation. Fault-tree logic used as one subprogrammes. The advantage approach it can be a large without...