Optimal algorithms for uncovering synteny problem

The syntenic distance between two genomes is the minimum number of fusions, fissions, and translocations that can transform one genome to the other, ignoring the gene order within chromosomes. As the problem is NP-hard in general, some particular classes of synteny instances, such as linear synteny, exact synteny and nested synteny, are examined in the literature. In this paper, we propose a new special class of synteny instances, called uncovering synteny. We first present a polynomial time algorithm to solve the connected case of uncovering synteny optimally. By performing only intra-component moves, we then solve the unconnected case of uncovering synteny. We will further calculate the diameters of connected and unconnected uncovering synteny, respectively.     

The robustness and optimality of response surface designs

Recent work on extended optimality criteria for robust designs is applied to response surface problems. Methods of calculation are described and the criteria illustrated with several examples. The extended criteria discriminate among designs equivalent by other criteria.     

Φp-optimal second order designs for symmetric regions

Designs for quadratic regression on a cube, on a cube with truncated vertices and on a ball are studied in terms of a family of criteria, introduced by Kiefer (1974, 1975), that includes A-, D- and E-optimality. Both theoretical and numerical results on structure and performance are presented. In particular, D- and E-optimal designs are described and a procedure of construction of nearly robust (under variation of criterion) integer designs is suggested. Some examples are given for dimensions 4, 5 and 6.     

Classification of Observations into One of Two Artificially Dichotomized Classes by Using a Normal Screening Variable

This article considers a problem of normal based two group classification when the groups are artificially dichotomized by a screening variable. Each group distribution is derived and the best regions for the classification are obtained. These derivations yield yet another classification rule. The rule is studied from several aspects such as the distribution of the rule, the optimal error rate, and the testing of a hypothesis. This article gives relationships among these aspects along with the investigation of the performance of the rule. The classification method and ideas are illustrated in detail with two examples.     

Minimum and Maximum Information Censoring Plans in Progressive Censoring

Expressions for the entropy, the Kullback-Leibler information, and the I _α-information are established for distributions of progressively Type-II censored order statistics. These results are used to identify minimum and maximum information censoring plans. In particular, we find minimum and maximum entropy plans for DFR, exponential, Pareto, reflected power, and Weibull distributions. The results for Kullback-Leibler and I _α-information hold for any continuous distribution.     

A Generalization of Geometric Brownian Motion with Applications

Although geometric Brownian motion has a great variety of applications, it can not cover all the random phenomena. The purpose of this article is to propose a model that generalizes geometric Brownian motion. We present some interesting applications of this model in financial engineering and statistical inferences for the unknown parameters.     

The Scale Invariant Wigner Spectrum Estimation of Gaussian Locally Self-Similar Processes

We study locally self-similar processes (LSSPs) in Silverman’s sense. By deriving the minimum mean-square optimal kernel within Cohen’s class counterpart of time–frequency representations, we obtain an optimal estimation for the scale invariant Wigner spectrum (SIWS) of Gaussian LSSPs. The class of estimators is completely characterized in terms of kernels, so the optimal kernel minimizes the mean-square error of the estimation. We obtain the SIWS estimation for two cases: global and local, where in the local case, the kernel is allowed to vary with time and frequency. We also introduce two generalizations of LSSPs: the locally self-similar chirp process and the multicomponent LSSP, and obtain their optimal kernels. Finally, the performance and accuracy of the estimation is studied via simulation.     

A-optimal designs for heteroscedastic multifactor regression models

Abstract

This paper searches for A-optimal designs for Kronecker product and additive regression models when the errors are heteroscedastic. Sufficient conditions are given so that A-optimal designs for the multifactor models can be built from A-optimal designs for their sub-models with a single factor. The results of an efficiency study carried out to check the adequacy of the products of optimal designs for uni-factor marginal models when these are used to estimate different multi-factor models are also reported.     

Construction of some compound criteria via A-optimality

Abstract

This paper is devoted to attain multiple objects via proposing two compound optimality criteria constructed with A-optimality criterion. The offered compound criteria are ADP-optimality to seek about an optimal design for minimizing the average variance, having an efficient parameter estimates, likewise, maximizing the probability of a particular event and AKL-optimality that provides an identified balance between model discrimination and minimizing the average variance of the parameter estimates. The equivalence theorems are stated and proved. Finally, a numerical example is applied on probit GLMs to illustrate the results for both compound criteria.     

On the design of comparative lifetime studies

In designing a study to compare two lifetime distributions, decisions are required about the study size, the proportion of observations in each group and the length of follow-up period. These aspects of study design are examined using a Bayesian approach in which the expected consequences of a particular choice of design are evaluated by the expected gain in infornlation.