Avoiding Divergence in the Shalvi-Weinstein Algorithm

The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the Shalvi-Weinstein algorithm (SWA). It is well-known that SWA presents a higher convergence rate than CMA. at the expense of higher computational complexity. If the forgetting factor is not sufficiently close to one, if the initialization is distant from the optimal solution, or if the signal-to-noise ratio is low, SWA can converge to undesirable local minima or even diverge. In this paper, we show that divergence can be caused by an inconsistency in the nonlinear estimate of the transmitted signal. or (when the algorithm is implemented in finite precision) by the loss of positiveness of the estimate of the autocorrelation matrix, or by a combination of both. In order to avoid the first cause of divergence, we propose a dual-mode SWA. In the first mode of operation. the new algorithm works as SWA; in the second mode, it rejects inconsistent estimates of the transmitted signal. Assuming the persistence of excitation condition, we present a deterministic stability analysis of the new algorithm. To avoid the second cause of divergence, we propose a dual-mode lattice SWA, which is stable even in finite-precision arithmetic, and has a computational complexity that increases linearly with the number of adjustable equalizer coefficients. The good performance of the proposed algorithms is confirmed through numerical simulations.

Jointly multi-user detection and channel estimation with genetic algorithm

This work aims at proposing the use of the evolutionary computation methodology in order to jointly solve the multiuser channel estimation (MuChE) and detection problems at its maximum-likelihood, both related to the direct sequence code division multiple access (DS/CDMA). The effectiveness of the proposed heuristic approach is proven by comparing performance and complexity merit figures with that obtained by traditional methods found in literature. Simulation results considering genetic algorithm (GA) applied to multipath, DS/CDMA and MuChE and multi-user detection (MuD) show that the proposed genetic algorithm multi-user channel estimation (GAMuChE) yields a normalized mean square error estimation (nMSE) inferior to 11%, under slowly varying multipath fading channels, large range of Doppler frequencies and medium system load, it exhibits lower complexity when compared to both maximum likelihood multi-user channel estimation (MLMuChE) and gradient descent method (GrdDsc). A near-optimum multi-user detector (MuD) based on the genetic algorithm (GAMuD), also proposed in this work, provides a significant reduction in the computational complexity when compared to the optimum multi-user detector (OMuD). In addition, the complexity of the GAMuChE and GAMuD algorithms were (jointly) analyzed in terms of number of operations necessary to reach the convergence, and compared to other jointly MuChE and MuD strategies. The joint GAMuChE-GAMuD scheme can be regarded as a promising alternative for implementing third-generation (3G) and fourth-generation (4G) wireless systems in the near future. Copyright (C) 2010 John Wiley & Sons, Ltd.

Hardware/firmware implementation of a soft sensor using an improved version of a fuzzy identification algorithm

This paper presents the design and implementation of an embedded soft sensor, i. e., a generic and autonomous hardware module, which can be applied to many complex plants, wherein a certain variable cannot be directly measured. It is implemented based on a fuzzy identification algorithm called ""Limited Rules"", employed to model continuous nonlinear processes. The fuzzy model has a Takagi-Sugeno-Kang structure and the premise parameters are defined based on the Fuzzy C-Means (FCM) clustering algorithm. The firmware contains the soft sensor and it runs online, estimating the target variable from other available variables. Tests have been performed using a simulated pH neutralization plant. The results of the embedded soft sensor have been considered satisfactory. A complete embedded inferential control system is also presented, including a soft sensor and a PID controller. (c) 2007, ISA. Published by Elsevier Ltd. All rights reserved.

The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm

This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound algorithm is proposed. Lower bounds and pruning rules that exploit properties of the problem are introduced. The proposed approach is examined through a computational comparative study with 280 problems involving different due date scenarios. In addition, the values of optimal solutions for small problems from a known benchmark are provided.

A log-extended Weibull regression model

A bathtub-shaped failure rate function is very useful in survival analysis and reliability studies. The well-known lifetime distributions do not have this property. For the first time, we propose a location-scale regression model based on the logarithm of an extended Weibull distribution which has the ability to deal with bathtub-shaped failure rate functions. We use the method of maximum likelihood to estimate the model parameters and some inferential procedures are presented. We reanalyze a real data set under the new model and the log-modified Weibull regression model. We perform a model check based on martingale-type residuals and generated envelopes and the statistics AIC and BIC to select appropriate models. (C) 2009 Elsevier B.V. All rights reserved.

Fate of Surface-Inoculated Escherichia coli O157:H7, Listeria monocytogenes, and Salmonella Typhimurium on Kippered Beef during Extended Storage at Refrigeration and Abusive Temperatures

The behavior of Escherichia coli O157:H7, Listeria monocytogenes, and Salmonella Typhimurium on kippered beef was evaluated. Individual pieces of the product were separately inoculated on the top and bottom surfaces with each three- to six-strain pathogen cocktail at ca. 6.0 log CFU per piece and stored at 4, 10, 21, or 30 degrees C for up to 28 days in each of two trials. When kippered beef was inoculated with E coli O157:H7, Salmonella Typhimurium, or L. monocytogenes and stored at 4, 10, 2 1, or 30 degrees C for up to 28 days, pathogen numbers decreased ca. 0.4 to 0.9, 1.0 to 1.8, 3.0 to >= 5.25, and >= 5.0 to 5.25 log CFU per piece, respectively. Average D-values for E. coli O157:H7, Salmonella Typhimurium, and L. monocytogenes stored at 4 to 30 degrees C for 28 days were ca. 41 to 4.6, 40.8 to 5.3, and 29.5 to 4.3 days, respectively. As expected, the higher the storage temperature, the greater the level and rate of inactivation for all three pathogens. These data establish that kippered beef does not provide an environment conducive to proliferation of these pathogens.

Predominance of CTX-M-type extended-spectrum beta-lactamase genes among enterobacterial isolates from outpatients in Brazil

Two hundred fifty-seven nalidixic acid-resistant enterobacterial isolates were collected in a Brazilian community from January 2000 to May 2005 to determine the prevalence of plasmid-encoded extended-spectrum beta-lactamases. The bla(CTX-M) genetic environment was determined by polymerase chain reaction and sequencing. Eleven isolates (4.2%) harbored a bla(CTX-M-2) gene, 3 isolates bla(CTX-M-9), 2 isolates bla(CTX-M-8), and 6 isolates bla(SHV-5). Two novel bla(CTX-M-2) variants, namely, bla(CTX-M-74) and bla(CTX-M-75), were identified. (C) 2009 Elsevier Inc. All rights reserved.

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.