<![CDATA[ IEEE Transactions on Reliability - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 24 2018March 19<![CDATA[Table of Contents]]>671C1192<![CDATA[IEEE Transactions on Reliability publication information]]>671C2C2117<![CDATA[Guest Editorial: Special Section on Reliability, Resilience, and Prognostics Modeling of Complex Engineering Systems]]>6712228<![CDATA[A Method to Improve the Robustness of Gas Turbine Gas-Path Fault Diagnosis Against Sensor Faults]]>671312873<![CDATA[Evaluation of Reliability Function and Mean Residual Life for Degrading Systems Subject to Condition Monitoring and Random Failure]]>6711325734<![CDATA[Evaluating Reliability/Survivability of Capacitated Wireless Networks]]>$k$-terminal reliability, all-terminal reliability, traffic efficiency, and $k$-connectivity), and its benefits and computational efficiency are discussed. An application is shown using heterogeneous wireless networks (HetNets). With the growing use of new telecommunication technologies such as 4G and wireless hotspots, HetNets are gaining more attention. The source of heterogeneity of a HetNet can either be the differences in nodes (such as transmission ranges, failure rates, and energy levels) or the differences in services offered in the network (such as GSM and WiFi).]]>6712640915<![CDATA[Nonparametric-Condition-Based Remaining Useful Life Prediction Incorporating External Factors]]>6714152565<![CDATA[Enabling Resilience of Complex Engineered Systems Using Control Theory]]>67153651175<![CDATA[Robustness of Subset Simulation to Functional Forms of Limit State Functions in System Reliability Analysis: Revisiting and Improvement]]>67166781998<![CDATA[Reliable Control of Discrete-Time Piecewise-Affine Time-Delay Systems via Output Feedback]]> $mathscr {H}_{infty }$ static output feedback (SOF) control for uncertain discrete-time piecewise-affine (PWA) systems with time-delay and actuator failure in a singular system setup. The Markov chain is applied to describe the actuator faults behaviors. In particular, by utilizing a system augmentation approach, the conventional closed-loop system is converted into a singular PWA system. By constructing a mode-dependent piecewise Lyapunov–Krasovskii functional, a new $mathscr {H}_{infty }$ performance analysis criterion is then presented, where a novel summation inequality and S-procedure are succeedingly employed. Subsequently, thanks to the special structure of the singular system formulation, the PWA SOF controller design is proposed via a convex program. Illustrative examples are finally given to show the efficacy and less conservatism of the presented approach.]]>6717991508<![CDATA[Exact Confidence Limits for the Acceleration Factor Under Constant-Stress Partially Accelerated Life Tests With Type-I Censoring]]>67192104534<![CDATA[Posterior Properties of the Nakagami-m Distribution Using Noninformative Priors and Applications in Reliability]]>m distribution plays an important role in problems related to communication engineering. This distribution can also be used for modeling reliability data as its hazard rate (mean residual life) function presents increasing (decreasing) or bathtub (unimodal) shapes. In this study, a Bayesian inference considering objective priors for the Nakagami-m distribution parameters is presented. We propose a theorem with sufficient and necessary conditions so that a general class of posteriors are proper. The impropriety of these posteriors can be observed by the behavior of the objective priors. This theorem is applied to different objective priors such as Jeffreys’ rule, Jeffreys prior, maximal data information prior, and reference priors. Simulation studies were conducted to investigate the performance of the Bayes estimators. Finally, our methodology is illustrated using two real lifetime datasets showing that the Nakagami-m distribution can be used to describe lifetime data.]]>671105117686<![CDATA[A New Analytical Approach for Interval Availability Analysis of Markov Repairable Systems]]>$[ {0,T} ]$, is an important indicator of system performance, especially for industries with a Service Level Agreement, e.g., telecommunication industry, computer industry, etc. Most existing methods to compute interval availability are based on numerical simulations. In this paper, we present a new analytical solution for interval availability of Markov repairable systems. Three interval availability indexes, i.e., interval availability, interval availability in a general interval, and interval availability in multiple intervals, are considered. The interval availability indexes are derived based on aggregated stochastic processes and the results are obtained in closed form using Laplace transforms. A numerical example is presented and the results are compared with those of Monte Carlo simulation. The developed methods are applied to calculate the interval availability of a fault-tolerant database system from the literature.]]>671118128671<![CDATA[Skew-Heavy-Tailed Degradation Models: An Application to Train Wheel Degradation]]>6711291411099<![CDATA[Accelerated Degradation Tests Planning With Competing Failure Modes]]>671142155702<![CDATA[Joint Optimization of Jobs Sequence and Inspection Policy for a Single System With Two-Stage Failure Process]]>n jobs with different processing times. The system has a two-stage failures process, i.e., first a defect arises in the system, and if the defect is not detected, the system eventually fails. The interrupted job due to failure should be restarted after corrective replacement of the system. The possibility of inspecting the system before starting a job is considered to detect a potential defect. We develop two models to find the optimal policy based on either total expected makespan, or total expected cost. In the cost optimization model, we assume a common due date for all jobs and incur a penalty cost per unit time that the makespan exceeds the due date. We develop a recursive formula to obtain the expected makespan, and the number of failures and preventive replacements and present the application of our proposed models to a system, which is supposed to process four jobs. We compare the results of the direct calculation (recursive formula) with a Monte Carlo simulation model, and discuss how changing the models’ parameters can impact the optimal policy.]]>671156169508<![CDATA[Prior Robustness for Bayesian Implementation of the Fault Tree Analysis]]>and and/or or gates. We then implement this Bayesian robustness approach on two real-life examples: a spacecraft re-entry example and a feeding control system example. We also provide a step-by-step illustration of how this approach can be applied to a real-life problem.]]>6711701831324<![CDATA[Degradation Modeling and Prediction of Ink Fading and Diffusion of Printed Images]]>671184195863<![CDATA[Minimizing Development Cost With Reliability Goal for Automotive Functional Safety During Design Phase]]>671196211880<![CDATA[Anomaly Detection Techniques Based on Kappa-Pruned Ensembles]]>6712122291001<![CDATA[Failure Mode and Effects Analysis by Using the House of Reliability-Based Rough VIKOR Approach]]>6712302481949<![CDATA[A Compiler Technique for Processor-Wide Protection From Soft Errors in Multithreaded Environments]]>$mu$ architecturally simulated microprocessor show that on average, MZDC can achieve more than 37$times$ better fault coverage than the state-of-the-art.]]>6712492632129<![CDATA[Fast Built-In Redundancy Analysis Based on Sequential Spare Line Allocation]]>6712642731659<![CDATA[A Shock-Based Model for the Reliability of Three-State Networks]]>$n$ binary components and three states: up, partial performance, and down. The components are subject to failure due to the occurrence of shocks appearing based on a counting process, and some of the components may fail as a result of each shock. To give a model for the reliability of the network, a new variant of the notion of two-dimensional signature is introduced, which is called two-dimensional t -signature. Based on this new notion, some mixture representations are given for the joint reliability function of the entrance times into a partial performance state $T_1$ and a down state $T$ . Several stochastic orderings and dependence properties regarding $T_1$ and $T$ are provided. The results are also explored for the special case when the shocks appear according to a nonhomogeneous pure birth process under different conditions.]]>671274284329<![CDATA[The Relationship Between $g$ -Restricted Connectivity and $g$-Good-Neighbor Fault Diagnosability of General Regular Networks]]>$g$-restricted connectivity ( $g$-RC) is the minimum vertex-set size of a network, whose deletion disconnects the network such that each remaining vertex has at least $g$ neighbors in its respective component. The $g$-RC is a deterministic indicator of tolerability of a network with failing processors. The $g$-good-neighbor fault diagnosability ($g$-GNFD) is the largest set size of correctly identified faulty vertices in a network such that any good vertex has no fewer $g$ good neighbors. This paper establishes the relationship between $g$-RC and $g$-GNFD of general regular networks, first under the PMC model and second under the MM* model. Moreover, this paper directly gives the $g$ -GNFD of some well-known special networks by their $g$-RC and our proposed relationship.]]>6712852961119<![CDATA[An $O({log}_2(N))$ Algorithm for Reliability Evaluation of $h$-Extra Edge-Connectivity of Folded Hypercubes]]>$h$-extra edge-connectivity of a given interconnected network $G$ with $N$ processors, denoted by $lambda _h(G)$, is the minimum cardinality of set of faulty links, such that whose removal will disconnect the network with all its resulting components having at least $h$ processors for $hleq N/2$. It gives a more refined quantitative analysis of indicators of the robustness of a multiprocessor system in the presence of failing links. The $n$-dimensional folded hypercube $FQ_n$, as one of potential interconnected networks, is a well-known variation of the hypercube structure with $N=2^{n}$ processors. In this paper, the $h$-extra edge-connectivity of the network $FQ_n$, $lambda _h(FQ_n)$, is first investigated for each well-defined positive integer $hleq N/2$. We divide the interval $1leq hleq N/2$ into some subintervals and obtain some proper-
ies of $lambda _h(FQ_n)$ in these subintervals. Then, we deduce a recursive relation of $lambda _h(FQ_n)$. Based on this recursion, an efficient $O({log}_2(N))$ algorithm is designed to totally determine the exact values and $lambda _h$-optimality of $lambda _h(FQ_n)$ for each $hleq N/2$.]]>6712973071012<![CDATA[Fast Algorithm for Searching $d$ -MPs for all Possible $d$]]>$d$ minimal path (MP), which is a special state vector formed by the addition of d MPs. The existing algorithm for searching $d$-MPs for all possible $d$ is based on the addition of MPs and $(d-1)$-MPs to generate d-MP combinations. This algorithm always requires extra time for detecting and removing the $d$ -MP combinations with infeasible states, redundant states, and/or duplicates. A more efficient addition-based algorithm is proposed to overcome the obstacles of the existing algorithm. Experiment shows that the proposed new algorithm is up to 14 000 faster than the existing algorithm. The time complexity and demonstration of the proposed algorithm are analyzed and provided using examples.]]>671308315616<![CDATA[An Integrated Prognostics Method for Failure Time Prediction of Gears Subject to the Surface Wear Failure Mode]]>671316327810<![CDATA[A Collaborative Learning Framework for Estimating Many Individualized Regression Models in a Heterogeneous Population]]>671328341878<![CDATA[Mission Abort Policy in Heterogeneous Nonrepairable 1-Out-of-N Warm Standby Systems]]>N warm standby systems subject to constant or adaptive mission abort policies. The system components are heterogeneous, characterized by different performances and different types of time-to-failure distributions. Based on the proposed evaluation method, we make another new contribution by formulating and solving the optimal mission abort problem, as well as a combined optimization problem that identifies the mission abort policy and component activation sequence maximizing mission success probability while achieving the desired level of system survivability. Efficiencies of constant and adaptive mission abort policies are compared through examples. Examples also demonstrate the tradeoff between system survivability and mission success probability due to the utilization of a mission abort policy. Such a tradeoff analysis can help identify optimal decisions on system mission abort and standby policies, promoting safe and reliable operation of warm standby systems.]]>671342354998<![CDATA[MalPat: Mining Patterns of Malicious and Benign Android Apps via Permission-Related APIs]]>$F_1$ score (98.24%) comparing with the state-of-the-art approaches.]]>6713553692281<![CDATA[Detection of Driver Vigilance Level Using EEG Signals and Driving Contexts]]>671370380958<![CDATA[A Fortification Model for Decentralized Supply Systems and Its Solution Algorithms]]>6713814001070<![CDATA[Optimal Inspection and Replacement Policies for Multi-Unit Systems Subject to Degradation]]>6714014131067<![CDATA[18th IEEE International Conference on Software Quality, Reliability, and Security (QRS 2018) and 4th International Symposium on System and Software Reliability (ISSSR 2018)]]>671414414738<![CDATA[IEEE Transactions on Reliability institutional listings]]>671C3C32541<![CDATA[IEEE Transactions on Reliability institutional listings]]>671C4C4763