A new framework for implicit restarting of the Krylov–Schur algorithm

This paper introduces a new framework for implicit restarting of the Krylov–Schur algorithm. It is shown that restarting with arbitrary polynomial filter is possible by reassigning some of the eigenvalues of the Rayleigh quotient through a rank‐one correction, implemented using only the elementary transformations (translation and similarity) of the Krylov decomposition. This framework includes the implicitly restarted Arnoldi (IRA) algorithm and the Krylov–Schur algorithm with implicit harmonic restart as special cases. Further, it reveals that the IRA algorithm can be turned into an eigenvalue assignment method. Copyright © 2014 John Wiley & Sons, Ltd.     

Parametric inference for multiple repairable systems under dependent competing risks

The focus of this article is on the analysis of repairable systems that are subject to multiple sources of recurrence. The event of interest at the system level is assumed to be caused by the earliest occurrence of a source, thereby conforming to a series system competing risks framework. Parametric inference is carried out under the power law process model that has found significant attention in industrial applications. Dependence among the cause‐specific recurrent processes is induced via a shared frailty structure. The theoretical inference results are implemented to a warranty database for a fleet of automobiles, for which the warranty repair is triggered by the failure of one of many components. Extensive finite‐sample simulation is carried out to supplement the asymptotic findings. Copyright © 2014 John Wiley & Sons, Ltd.     

Forwarding and optical indices of 4-regular circulant networks

An all-to-all routing in a graph G is a set of oriented paths of G, with exactly one path for each ordered pair of vertices. The load of an edge under an all-to-all routing R is the number of times it is used (in either direction) by paths of R, and the maximum load of an edge is denoted by $\pi (G,R)$. The edge-forwarding index $\pi (G)$ is the minimum of $\pi (G,R)$ over all possible all-to-all routings R, and the arc-forwarding index $\overrightarrow{\pi }(G)$ is defined similarly by taking direction into consideration, where an arc is an ordered pair of adjacent vertices. Denote by $w(G,R)$ the minimum number of colours required to colour the paths of R such that any two paths having an edge in common receive distinct colours. The optical index $w(G)$ is defined to be the minimum of $w(G,R)$ over all possible R, and the directed optical index $\overrightarrow{w}(G)$ is defined similarly by requiring that any two paths having an arc in common receive distinct colours. In this paper we obtain lower and upper bounds on these four invariants for 4-regular circulant graphs with connection set $\{\pm 1,\pm s\}$, $1<s<n/2$. We give approximation algorithms with performance ratio a small constant for the corresponding forwarding index and routing and wavelength assignment problems for some families of 4-regular circulant graphs.     

Determination of 12 potential nephrotoxicity biomarkers in rat serum and urine by liquid chromatography with mass spectrometry and its application to renal failure induced by Semen Strychni

In previous nephrotoxicity metabonomic studies, several potential biomarkers were found and evaluated. To investigate the relationship between the nephrotoxicity biomarkers and the therapeutic role of Radix Glycyrrhizae extract on Semen Strychni‐induced renal failure, 12 typical biomarkers are selected and a simple LC–MS method has been developed and validated. Citric acid, guanidinosuccinic acid, taurine, guanidinoacetic acid, uric acid, creatinine, hippuric acid, xanthurenic acid, kynurenic acid, 3‐indoxyl sulfate, indole‐3‐acetic acid, and phenaceturic acid were separated by a Phenomenex Luna C₁₈ column and a methanol/water (5 mM ammonium acetate) gradient program with a runtime of 20 min. The prepared calibration curves showed good linearity with regression coefficients all above 0.9913. The absolute recoveries of analytes from serum and urine were all more than 70.4%. With the developed method, analytes were successfully determined in serum and urine samples within 52 days. Results showed that guanidinosuccinic acid, guanidinoacetic acid, 3‐indoxyl sulfate, and indole‐3‐acetic acid (only in urine) were more sensitive than the conventional renal function markers in evaluating the therapeutic role of Radix Glycyrrhizae extract on Semen Strychni‐induced renal failure. The method could be further used in predicting and monitoring renal failure cause by other reasons in the following researches.     

Practical cross‐layer routing and channel assignment in cognitive radio ad hoc networks

In the heterogeneous and unreliable channel environment of cognitive radio ad hoc networks (CRAHNs), a multipath route with channel assigned is preferable in both throughput and reliability. The cross‐layer multipath routing and channel assignment in CRAHNs is becoming a challenging issue. In this paper, this problem is characterized, formulated, and shown to be in the form of mixed integer programming. For this Non‐deterministic Polynomial‐time (NP)‐hard problem, the deficiency of the widely used linearization and sequential fixing algorithm is first analyzed. The main contribution of this paper is the development of a new backtracking algorithm with feasibility checking to search optimal solutions and a heuristic algorithm with high feasible solution‐obtained probability (HHFOP) for distributed application in CRAHNs. Through feasibility checking and solution bounds validating, backtracking algorithm with feasibility checking cuts off unnecessary searching space in early stage without loss of optimal solutions, making it much more efficient than brute searching. For practical application in CRAHNs with polynomial complexity, HHFOP first computes the maximal‐supported throughput through link‐channel assignment and link‐capacity coordination for each candidate path. Then the paths are combined, and the route throughput is optimized. Extensive simulation results demonstrate that HHFOP can achieve a high feasible solution‐obtained probability with little throughput degradation compared with linearization and sequential fixing algorithm, indicating its practicability for distributed applications in CRAHNs. Copyright © 2013 John Wiley & Sons, Ltd.     

Machine learning as an online diagnostic tool for proton exchange membrane fuel cells

Proton exchange membrane fuel cells are considered a promising power supply system with high efficiency and zero emissions. They typically work within a relatively narrow range of temperature and humidity to achieve optimal performance; however, this makes the system difficult to control, leading to faults and accelerated degradation. Two main approaches can be used for diagnosis, limited data input which provides an unintrusive, rapid but limited analysis, or advanced characterisation that provides a more accurate diagnosis but often requires invasive or slow measurements. To provide an accurate diagnosis with rapid data acquisition, machine learning methods have shown great potential. However, there is a broad approach to the diagnostic algorithms and signals used in the field. This article provides a critical view of the current approaches and suggests recommendations for future methodologies of machine learning in fuel cell diagnostic applications.     

Heart Failure and PAHs,OHPAHs, and Trace Elements Levels in Human Serum: Results from a Preliminary Pilot Study in Greek Population and the Possible Impact of Air Pollution

Cardiovascular diseases (CVDs) have been associated with environmental pollutants. The scope of this study is to assess any potential relation of polycyclic aromatic hydrocarbons (PAHs), their hydroxylated derivatives, and trace elements with heart failure via their direct determination in human serum of Greek citizens residing in different areas. Therefore, we analyzed 131 samples including cases (heart failure patients) and controls (healthy donors), and the respective demographic data were collected. Significantly higher concentrations (p < 0.05) were observed in cases’ serum regarding most of the examined PAHs and their derivatives with phenanthrene, fluorene, and fluoranthene being the most abundant (median of >50 μg L⁻¹). Among the examined trace elements, As, Cd, Cu, Hg, Ni, and Pb were measured at statistically higher concentrations (p < 0.05) in cases’ samples, with only Cr being significantly higher in controls. The potential impact of environmental factors such as smoking and area of residence has been evaluated. Specific PAHs and trace elements could be possibly related with heart failure development. Atmospheric degradation and smoking habit appeared to have a significant impact on the analytes’ serum concentrations. PCA–logistic regression analysis could possibly reveal common mechanisms among the analytes enhancing the hypothesis that they may pose a significant risk for CVD development.     

Evaluation of Multi-Objective Optimization Algorithms for NMR Chemical Shift Assignment

An automated NMR chemical shift assignment algorithm was developed using multi-objective optimization techniques. The problem is modeled as a combinatorial optimization problem and its objective parameters are defined separately in different score functions. Some of the heuristic approaches of evolutionary optimization are employed in this problem model. Both, a conventional genetic algorithm and multi-objective methods, i.e., the non-dominated sorting genetic algorithms II and III (NSGA2 and NSGA3), are applied to the problem. The multi-objective approaches consider each objective parameter separately, whereas the genetic algorithm followed a conventional way, where all objectives are combined in one score function. Several improvement steps and repetitions on these algorithms are performed and their combinations are also created as a hyper-heuristic approach to the problem. Additionally, a hill-climbing algorithm is also applied after the evolutionary algorithm steps. The algorithms are tested on several different datasets with a set of 11 commonly used spectra. The test results showed that our algorithm could assign both sidechain and backbone atoms fully automatically without any manual interactions. Our approaches could provide around a 65% success rate and could assign some of the atoms that could not be assigned by other methods.     

A method for C(alpha) direct-detection in protonless NMR

Attempts are made to efficiently decouple (13)C nuclei without significant loss of coherence during the application of the decoupling package. Such attempts are based on the S(3)E spin-state selection method. A newly developed double S(3)E (DS(3)E) is particularly efficient for C(alpha) detection for proteins as large as 480 kDa.