A new algorithm and refined bounds for extended gcd computation

Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides refined bounds on the size of the multipliers obtained.

Extended GCD and Hermite normal form algorithms via lattice basis reduction

Extended gcd calculation has a long history and plays an important role in computational number theory and linear algebra. Recent results have shown that finding optimal multipliers in extended gcd calculations is difficult. We present an algorithm which uses lattice basis reduction to produce small integer multipliers x(1), ..., x(m) for the equation s = gcd (s(1), ..., s(m)) = x(1)s(1) + ... + x(m)s(m), where s1, ... , s(m) are given integers. The method generalises to produce small unimodular transformation matrices for computing the Hermite normal form of an integer matrix.

The subcycled Newmark algorithm

The popular Newmark algorithm, used for implicit direct integration of structural dynamics, is extended by means of a nodal partition to permit use of different timesteps in different regions of a structural model. The algorithm developed has as a special case an explicit-explicit subcycling algorithm previously reported by Belytschko, Yen and Mullen. That algorithm has been shown, in the absence of damping or other energy dissipation, to exhibit instability over narrow timestep ranges that become narrower as the number of degrees of freedom increases, making them unlikely to be encountered in practice. The present algorithm avoids such instabilities in the case of a one to two timestep ratio (two subcycles), achieving unconditional stability in an exponential sense for a linear problem. However, with three or more subcycles, the trapezoidal rule exhibits stability that becomes conditional, falling towards that of the central difference method as the number of subcycles increases. Instabilities over narrow timestep ranges, that become narrower as the model size increases, also appear with three or more subcycles. However by moving the partition between timesteps one row of elements into the region suitable for integration with the larger timestep these the unstable timestep ranges become extremely narrow, even in simple systems with a few degrees of freedom. As well, accuracy is improved. Use of a version of the Newmark algorithm that dissipates high frequencies minimises or eliminates these narrow bands of instability. Viscous damping is also shown to remove these instabilities, at the expense of having more effect on the low frequency response.

An improved seeded region growing algorithm

Recently Adams and Bischof (1994) proposed a novel region growing algorithm for segmenting intensity images. The inputs to the algorithm are the intensity image and a set of seeds - individual points or connected components - that identify the individual regions to be segmented. The algorithm grows these seed regions until all of the image pixels have been assimilated. Unfortunately the algorithm is inherently dependent on the order of pixel processing. This means, for example, that raster order processing and anti-raster order processing do not, in general, lead to the same tessellation. In this paper we propose an improved seeded region growing algorithm that retains the advantages of the Adams and Bischof algorithm fast execution, robust segmentation, and no tuning parameters - but is pixel order independent. (C) 1997 Elsevier Science B.V.

Interference in hyperbolic space

The interference in a phase space algorithm of Schleich and Wheeler [Nature 326, 574 (1987)] is extended to the hyperbolic space underlying the group SU(1,1). The extension involves introducing the notion of weighted areas. Analytic expressions for the asymptotic forms for overlaps between the eigenstates of the generators of su(1,1) thus obtained are found to be in excellent agreement with the numerical results.[S1050-2947(98)08602-8].

Investigation of the antinociceptive efficacy and relative potency of extended duration injectable 3-acylmorphine-6-sulfate prodrugs in rats

This investigation was designed to examine the antinociceptive activity in rats of 3-O-acyl prodrugs of M6S relative to the parent drug, after intravenous and intramuscular injection, using the tail flick latency test of antinociception. M6S, 3-acetylmorphine-6-sulfate (3AcM6S), 3-propionylmorphine-6-sulfate (3PrM6S), 3-butanoylmorphine-6-sulfate (3BuM6S) and 3-heptanoylmorphine-6-sulfate (3HpM6S) were administered by the IV route in a dose of 4.10 mu mol/kg. Relatively high levels of antinociception (>40% Maximum Possible Effect) were achieved following administration of M6S, 3AcM6S and 3PrM6S, whereas insignificant antinociception (<20%MPE) was achieved following administration of 3BuM6S or 3HpM6S. Although the mean duration of action for 3AcM6S (6 h) was longer than for M6S or 3PrM6S (4 h), the mean area (+/- S.E.M.) under the degree of antinociception versus time curve (AUG) for 3AcM6S (151.6 +/- 6.9%MPE h) was not significantly different (p <0.05) from that for M6S (120.8 +/- 32.7%MPE h) or for 3PrM6S (106.0 +/- 21.3%MPE h). The mean ED50 (range) doses for M6S, 3AcM6S and 3PrM6S were calculated to be 4.16 (3.61-4.48), 4.32 (3.55-5.09) and 4.54 (4.21-4.79) mu mol/kg, respectively. Preliminary studies were conducted on potential long-acting formulations containing 8 x ED50 doses of M6S and the 3-acetyl and 3-propionyl esters suspended in soybean oil. These showed that 3PrM6S gave a greater AUC (mean + S.E.M.) (1087.4 +/- 97.4%MPE h) and longer duration of action (20 h) than did M6S (613.1 +/- 155.9%MPE h; 10 h duration) or 3AcM6S (379.3 + 114.2%MPE h: 8 h duration). Further studies are needed to more fully investigate these findings. (C) 1998 Elsevier Science B.V. All rights reserved.

Extended delayed recall of AVLT word lists: Effects of age and sex on adult performance

An extension of a previous study of age and sex effects on verbal recall (Geffen, Moar, O'Hanlon, lark, & Geffen, 1990) examined forgetting of words over extended delays. The AVLT was administered to 201 normal adults (99 males, 102 females) ranging in age between 20 and 59 years. Recall was tested at intervals of 30 minutes, 24 hours, and 7 days after acquisition. Testing of the latter two intervals was conducted by telephone (Experiment 1, N = 177). After 30 minutes there was no significant loss of the 10 to 11 words retained from five acquisition trials. However, an overall mean of about one word was forgotten after 1 day and a further word after 7 days. The oldest age group (50-59 years) acquired fewer words and forgot more words than the younger groups. Females of all age groups performed slightly better than males at acquisition, at retention, and at recall after longer delays. A second experiment showed that telephone testing at the longer delay intervals was equivalent to testing face to face. These results extend the use of the AVLT by assessing memory decay beyond the immediate testing period. Telephone follow-up is a convenient and economical method of testing delayed recall.

Prediction of MHC class II-binding peptides using an evolutionary algorithm and artificial neural network

Motivation: Prediction methods for identifying binding peptides could minimize the number of peptides required to be synthesized and assayed, and thereby facilitate the identification of potential T-cell epitopes. We developed a bioinformatic method for the prediction of peptide binding to MHC class II molecules. Results: Experimental binding data and expert knowledge of anchor positions and binding motifs were combined with an evolutionary algorithm (EA) and an artificial neural network (ANN): binding data extraction --> peptide alignment --> ANN training and classification. This method, termed PERUN, was implemented for the prediction of peptides that bind to HLA-DR4(B1*0401). The respective positive predictive values of PERUN predictions of high-, moderate-, low- and zero-affinity binder-a were assessed as 0.8, 0.7, 0.5 and 0.8 by cross-validation, and 1.0, 0.8, 0.3 and 0.7 by experimental binding. This illustrates the synergy between experimentation and computer modeling, and its application to the identification of potential immunotheraaeutic peptides.

A consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements

To translate and transfer solution data between two totally different meshes (i.e. mesh 1 and mesh 2), a consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements is presented in this paper. The proposed algorithm has the following significant advantages: (1) The use of a point-searching strategy allows a point in one mesh to be accurately related to an element (containing this point) in another mesh. Thus, to translate/transfer the solution of any particular point from mesh 2 td mesh 1, only one element in mesh 2 needs to be inversely mapped. This certainly minimizes the number of elements, to which the inverse mapping is applied. In this regard, the present algorithm is very effective and efficient. (2) Analytical solutions to the local co ordinates of any point in a four-node quadrilateral element, which are derived in a rigorous mathematical manner in the context of this paper, make it possible to carry out an inverse mapping process very effectively and efficiently. (3) The use of consistent interpolation enables the interpolated solution to be compatible with an original solution and, therefore guarantees the interpolated solution of extremely high accuracy. After the mathematical formulations of the algorithm are presented, the algorithm is tested and validated through a challenging problem. The related results from the test problem have demonstrated the generality, accuracy, effectiveness, efficiency and robustness of the proposed consistent point-searching algorithm. Copyright (C) 1999 John Wiley & Sons, Ltd.

Extended integrability regime for the supersymmetric U model

An extension of the supersymmetric U model for correlated electrons is given and integrability is established by demonstrating that the model can he constructed through the quantum inverse scattering method using an R-matrix without the difference property. Some general symmetry properties of the model are discussed and from the Bethe ansatz solution an expression for the energies is presented.

Integrable Kondo impurities in the one-dimensional supersymmetric extended Hubbard model

An integrable Kondo problem in the one-dimensional supersymmetric extended Hubbard model is studied by means of the boundary graded quantum inverse scattering method. The boundary K-matrices depending on the local moments of the impurities are presented as a non-trivial realization of the graded reflection equation algebras in a two-dimensional impurity Hilbert space. Further, the model is solved by using the algebraic Bethe ansatz method and the Bethe ansatz equations are obtained.

Modeling of hepatic elimination and organ distribution kinetics with the extended convection-dispersion model

The conventional convection-dispersion (also called axial dispersion) model is widely used to interrelate hepatic availability (F) and clearance (Cl) with the morphology and physiology of the liver and to predict effects such as changes in liver blood flow on F and Cl. An extended form of the convection-dispersion model has been developed to adequately describe the outflow concentration-time profiles for vascular markers at both short and long times after bolus injections into perfused livers. The model, based on flux concentration and a convolution of catheters and large vessels, assumes that solute elimination in hepatocytes follows either fast distribution into or radial diffusion in hepatocytes. The model includes a secondary vascular compartment, postulated to be interconnecting sinusoids. Analysis of the mean hepatic transit time (MTT) and normalized variance (CV2) of solutes with extraction showed that the discrepancy between the predictions of MTT and CV2 for the extended and conventional models are essentially identical irrespective of the magnitude of rate constants representing permeability, volume, and clearance parameters, providing that there is significant hepatic extraction. In conclusion, the application of a newly developed extended convection-dispersion model has shown that the unweighted conventional convection-dispersion model can be used to describe the disposition of extracted solutes and, in particular, to estimate hepatic availability and clearance in booth experimental and clinical situations.