The choice of an appropriate method for fitting a straight line to data is one of the major procedural problems in bivariate allometric analysis. Commonly used techniques, such as ordinary least-squares regression and major axis, are derived from the general structural relationship model and thus require some knowledge about the distribution of the data. In this paper, we explore a nonparametri...

The new crystal structure of 5,6-dibromoacenaphthene has been successfully determined from X-ray powder diffraction data with monoclinic crystals, P21/n, a = 7.88(1) Å, b = 11.64(1) Å, c = 11.62(1) Å, β =107.09(9)°, V = 1019.9(1) Å and Z = 4. Individual reflection intensities were extracted by means of Le Bail’s method. The molecular structure of 1 was solved by direct methods and refined using...

Introduction: Quantifying magnetic susceptibility of biological tissue using MRI has important clinical implications such as quantifying iron deposition in liver and sub-cortical structures, measuring oxygen saturation in blood, differentiating a hemorrhagic lesion as acute or chronic and identifying calcifications etc.. MR susceptometry of substances taken in standard sphere or cylinder geomet...

An important problem for tting local linear regression is the choice of the smoothing parameter. As the smoothing parameter becomes large, the estimator tends to a straight line, which is the least squares t in the ordinary linear regression setting. This property may be used to assess the adequacy of a simple linear model. Motivated by Silverman's (1981) work for testing multimodality in kerne...

The use of residuals for detecting departures from the assumptions of the linear model, whether full rank or not, has long been recognized as an important diagnostic tool, once it became computationally feasible to compute them in a straight forward way, and several contributions to the literature have focussed on their underlying properties and their effectiveness. The recursive residuals are ...

We solve the problems of detecting and counting various forms of regularities in a string represented as a Straight Line Program (SLP). Given an SLP of size n that represents a string s of length N , our algorithm compute all runs and squares in s in O(nh) time and O(n) space, where h is the height of the derivation tree of the SLP. We also show an algorithm to compute all gapped-palindromes in...