Smoothed rank-based procedure for censored data

A smoothed rank-based procedure is developed for the accelerated failure time model to overcome computational issues. The proposed estimator is based on an EM-type procedure coupled with the induced smoothing. "The proposed iterative approach converges provided the initial value is based on a consistent estimator, and the limiting covariance matrix can be obtained from a sandwich-type formula. The consistency and asymptotic normality of the proposed estimator are also established. Extensive simulations show that the new estimator is not only computationally less demanding but also more reliable than the other existing estimators.

Extension of k-ratio methods to rank-based analyses

An extension of k-ratio multiple comparison methods to rank-based analyses is described. The new method is analogous to the Duncan-Godbold approximate k-ratio procedure for unequal sample sizes or correlated means. The close parallel of the new methods to the Duncan-Godbold approach is shown by demonstrating that they are based upon different parameterizations as starting points.^ A semi-parametric basis for the new methods is shown by starting from the Cox proportional hazards model, using Wald statistics. From there the log-rank and Gehan-Breslow-Wilcoxon methods may be seen as score statistic based methods.^ Simulations and analysis of a published data set are used to show the performance of the new methods. ^

Efficient estimation for rank-based regression with clustered data

Rank-based inference is widely used because of its robustness. This article provides optimal rank-based estimating functions in analysis of clustered data with random cluster effects. The extensive simulation studies carried out to evaluate the performance of the proposed method demonstrate that it is robust to outliers and is highly efficient given the existence of strong cluster correlations. The performance of the proposed method is satisfactory even when the correlation structure is misspecified, or when heteroscedasticity in variance is present. Finally, a real dataset is analyzed for illustration.

Rank-based regression for analysis of repeated measures

We consider rank-based regression models for repeated measures. To account for possible withinsubject correlations, we decompose the total ranks into between- and within-subject ranks and obtain two different estimators based on between- and within-subject ranks. A simple perturbation method is then introduced to generate bootstrap replicates of the estimating functions and the parameter estimates. This provides a convenient way for combining the corresponding two types of estimating function for more efficient estimation.

Application of a rank-based genetic association test to age-at-onset data from the Collaborative Study on the Genetics of Alcoholism study.

Association studies of quantitative traits have often relied on methods in which a normal distribution of the trait is assumed. However, quantitative phenotypes from complex human diseases are often censored, highly skewed, or contaminated with outlying values. We recently developed a rank-based association method that takes into account censoring and makes no distributional assumptions about the trait. In this study, we applied our new method to age-at-onset data on ALDX1 and ALDX2. Both traits are highly skewed (skewness > 1.9) and often censored. We performed a whole genome association study of age at onset of the ALDX1 trait using Illumina single-nucleotide polymorphisms. Only slightly more than 5% of markers were significant. However, we identified two regions on chromosomes 14 and 15, which each have at least four significant markers clustering together. These two regions may harbor genes that regulate age at onset of ALDX1 and ALDX2. Future fine mapping of these two regions with densely spaced markers is warranted.

A green flow-based procedure for fluorimetric determination of acid-dissociable cyanide in natural waters exploiting multicommutation

A flow system designed with solenoid valves is proposed for determination of weak acid dissociable cyanide, based on the reaction with o-phthalaldehyde (OPA) and glycine yielding a highly fluorescent isoindole derivative. The proposed procedure minimizes the main drawbacks related to the reference batch procedure, based on reaction with barbituric acid and pyridine followed by spectrophotometric detection, i.e., use of toxic reagents, high reagent consumption and waste generation, low sampling rate, and poor sensitivity. Retention of the sample zone was exploited to increase the conversion rate of the analyte with minimized sample dispersion. Linear response (r=0.999) was observed for cyanide concentrations in the range 1-200 mu g L(-1), with a detection limit (99.7% confidence level) of 0.5 mu g L(-1)(19 nmol L(-1)). The sampling rate and coefficient of variation (n=10) were estimated as 22 measurements per hour and 1.4%, respectively. The results of determination of weak acid dissociable cyanide in natural water samples were in agreement with those achieved by the batch reference procedure at the 95% confidence level. Additionally to the improvement in the analytical features in comparison with those of the flow system with continuous reagent addition (sensitivity and sampling rate 90 and 83% higher, respectively), the consumption of OPA was 230-fold lower.

Orbit based procedure for doublets of scalar fields and the emergence of triple kinks and other defects

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Detecting determinism with improved sensitivity in time series: Rank-based nonlinear predictability score

The rank-based nonlinear predictability score was recently introduced as a test for determinism in point processes. We here adapt this measure to time series sampled from time-continuous flows. We use noisy Lorenz signals to compare this approach against a classical amplitude-based nonlinear prediction error. Both measures show an almost identical robustness against Gaussian white noise. In contrast, when the amplitude distribution of the noise has a narrower central peak and heavier tails than the normal distribution, the rank-based nonlinear predictability score outperforms the amplitude-based nonlinear prediction error. For this type of noise, the nonlinear predictability score has a higher sensitivity for deterministic structure in noisy signals. It also yields a higher statistical power in a surrogate test of the null hypothesis of linear stochastic correlated signals. We show the high relevance of this improved performance in an application to electroencephalographic (EEG) recordings from epilepsy patients. Here the nonlinear predictability score again appears of higher sensitivity to nonrandomness. Importantly, it yields an improved contrast between signals recorded from brain areas where the first ictal EEG signal changes were detected (focal EEG signals) versus signals recorded from brain areas that were not involved at seizure onset (nonfocal EEG signals).

ϕ-Divergence Based Procedure for Parametric Change-Point Problems

This paper studies the change-point problem for a general parametric, univariate or multivariate family of distributions. An information theoretic procedure is developed which is based on general divergence measures for testing the hypothesis of the existence of a change. For comparing the exact sizes of the new test-statistic using the criterion proposed in Dale (J R Stat Soc B 48–59, 1986), a simulation study is performed for the special case of exponentially distributed random variables. A complete study of powers of the test-statistics and their corresponding relative local efficiencies, is also considered.

A rank-based ant system algorithm for solving 0/1 knapsack problem

The 0/1 Knapsack Problem (KP), which is a classical NP-complete problem, has been widely applied to solving many real world problems. Ant system (AS), as one of the earliest ant colony optimization (ACO) algorithms, provides approximate solutions to 0/1 KPs. However, there are some shortcomings such as low efficiency and premature convergence in most AS algorithms. In order to overcome the shortcomings of AS, this paper proposes a rank-based AS algorithm, denoted as RAS to solve 0/1 KP. Taking advantages of the ranked ants with a higher profit, the pheromone of items will be updated with better solutions in RAS. Experimental results in different datasets show that this new kind of AS algorithm can obtain a higher efficiency and robustness when solving 0/1 KP.

Rank-based Image watermarking method with high embedding capacity and robustness

This paper presents a novel rank-based method for image watermarking. In the watermark embedding process, the host image is divided into blocks, followed by the 2-D discrete cosine transform (DCT). For each image block, a secret key is employed to randomly select a set of DCT coefficients suitable for watermark embedding. Watermark bits are inserted into an image block by modifying the set of DCT coefficients using a rank-based embedding rule. In the watermark detection process, the corresponding detection matrices are formed from the received image using the secret key. Afterward, the watermark bits are extracted by checking the ranks of the detection matrices. Since the proposed watermarking method only uses two DCT coefficients to hide one watermark bit, it can achieve very high embedding capacity. Moreover, our method is free of host signal interference. This desired feature and the usage of an error buffer in watermark embedding result in high robustness against attacks. Theoretical analysis and experimental results demonstrate the effectiveness of the proposed method.

A high embedding capacity image watermarking method with rank-based embedder and decoder

High embedding capacity is desired in digital image watermarking. In this paper, we propose a novel rank-based image watermarking method to achieve high embedding capacity. We first divide the host image into blocks. Then the 2-D discrete cosine transform (DCT) and zigzag scanning is used to construct the coefficient sets with a secret key. After that, the DCT coefficient sets are modified using a rank-based embedding strategy to insert the watermark bits. A buffer is also introduced during the embedding phase to enhance the robustness. At the decoding step, the watermark bits are extracted by checking the ranks of the detection matrices. The proposed method is host signal interference (HSI) free, invariant to amplitude scaling and constant luminance change, and robust against other common signal processing attacks. Experimental results demonstrate the effectiveness of the proposed method.