The contribution of HGAL/GCET2 in immunohistological algorithms: a comparative study in 424 cases of nodal diffuse large B-cell lymphoma

Diffuse large B-cell lymphoma can be subclassified into at least two molecular subgroups by gene expression profiling: germinal center B-cell like and activated B-cell like diffuse large B-cell lymphoma. Several immunohistological algorithms have been proposed as surrogates to gene expression profiling at the level of protein expression, but their reliability has been an issue of controversy. Furthermore, the proportion of misclassified cases of germinal center B-cell subgroup by immunohistochemistry, in all reported algorithms, is higher compared with germinal center B-cell cases defined by gene expression profiling. We analyzed 424 cases of nodal diffuse large B-cell lymphoma with the panel of markers included in the three previously described algorithms: Hans, Choi, and Tally. To test whether the sensitivity of detecting germinal center B-cell cases could be improved, the germinal center B-cell marker HGAL/GCET2 was also added to all three algorithms. Our results show that the inclusion of HGAL/GCET2 significantly increased the detection of germinal center B-cell cases in all three algorithms (P<0.001). The proportions of germinal center B-cell cases in the original algorithms were 27%, 34%, and 19% for Hans, Choi, and Tally, respectively. In the modified algorithms, with the inclusion of HGAL/GCET2, the frequencies of germinal center B-cell cases were increased to 38%, 48%, and 35%, respectively. Therefore, HGAL/GCET2 protein expression may function as a marker for germinal center B-cell type diffuse large B-cell lymphoma. Consideration should be given to the inclusion of HGAL/GCET2 analysis in algorithms to better predict the cell of origin. These findings bear further validation, from comparison to gene expression profiles and from clinical/therapeutic data. Modern Pathology (2012) 25, 1439-1445; doi: 10.1038/modpathol.2012.119; published online 29 June 2012

Multiloop controller and reference generator for a dynamic voltage restorer implementation

This paper deals with the design and analysis of a Dynamic Voltage Restorer output voltage control. Such control is based on a multiloop strategy, with an inner current PID regulator and an outer P+Resonant voltage controller. The inner regulator is applied on the output inductor current. It will be also demonstrated how the load current behavior may influence in the DVR output voltage, which justifies the need for the resonant controller. Additionally, it will be discussed the application of a modified algorithm for the identification of the DVR voltage references, which is based on a previously presented positive sequence detector. Since the studied three-phase DVR is assumed to be based on three identical H-bridge converters, all the analysis and design procedures were realized by means of single-phase equivalent circuits. The discussions and conclusions are supported by theoretical calculations, nonlinear simulations and some experimental results. ©2008 IEEE.

Rechnergestützte Planung von Distributionszentren durch Einsatz der Graphentheorie

Obwohl Distributionszentren (DZ) zentrale Kernelemente von Lieferketten darstellen, lässt sich gegenwärtig keine strukturierte Methodik finden, um diese objektiv, systematisch und insbesondere ganzheitlich über alle Funktionsbereiche hinweg – vom Wareneingang über die Kommissionierung bis zum Warenausgang – zu planen. Der vorliegende Artikel befasst sich mit dieser wissenschaftlichen Lücke und beschreibt wie mit Hilfe von analytisch modellierten Standardmodulen innerhalb der verschiedenen Funktionsbereiche eines DZ durch Anwendung eines graphentheoretischen Ansatzes funktionsbereichsübergreifende Varianten von DZ generiert werden können. Zur automatisierten Ermittlung der optimalen Standardmodulkombination bzw. der optimalen DZ-Variante werden modifizierte Algorithmen zur Findung der kürzesten Wege innerhalb eines Graphen angewendet.

Relaxation of alternating iterative algorithms for the Cauchy problem associated with the modified Helmholtz equation

We propose two algorithms involving the relaxation of either the given Dirichlet data or the prescribed Neumann data on the over-specified boundary, in the case of the alternating iterative algorithm of ` 12 ` 12 `$12 `&12 `#12 `^12 `_12 `%12 `~12 *Kozlov91 applied to Cauchy problems for the modified Helmholtz equation. A convergence proof of these relaxation methods is given, along with a stopping criterion. The numerical results obtained using these procedures, in conjunction with the boundary element method (BEM), show the numerical stability, convergence, consistency and computational efficiency of the proposed methods.

A study of the stability of subcycling algorithms in structural dynamics

Algorithms for explicit integration of structural dynamics problems with multiple time steps (subcycling) are investigated. Only one such algorithm, due to Smolinski and Sleith has proved to be stable in a classical sense. A simplified version of this algorithm that retains its stability is presented. However, as with the original version, it can be shown to sacrifice accuracy to achieve stability. Another algorithm in use is shown to be only statistically stable, in that a probability of stability can be assigned if appropriate time step limits are observed. This probability improves rapidly with the number of degrees of freedom in a finite element model. The stability problems are shown to be a property of the central difference method itself, which is modified to give the subcycling algorithm. A related problem is shown to arise when a constraint equation in time is introduced into a time-continuous space-time finite element model. (C) 1998 Elsevier Science S.A.

Control of baker’s yeast fermentation: PID and fuzzy algorithms

A MATLAB/SIMULINK-based simulator was employed for studies concerning the control of baker’s yeast fed-batch fermentation. Four control algorithms were implemented and compared: the classical PID control, two discrete versions- modified velocity and position algorithms, and a fuzzy law. The simulation package was seen to be an efficient tool for the simulation and tests of control strategies of the nonlinear process.

Programació d'una aplicació gràfica per l'anàlisi de senyals usant LDB (Local Discriminant Bases) i MLDB (Modified LDB)

Tot seguit presentem un entorn per analitzar senyals de tot tipus amb LDB (Local Discriminant Bases) i MLDB (Modified Local Discriminant Bases). Aquest entorn utilitza funcions desenvolupades en el marc d’una tesi en fase de desenvolupament. Per entendre part d’aquestes funcions es requereix un nivell de coneixement avançat de processament de senyals. S’han extret dels treballs realitzats per Naoki Saito [3], que s’han agafat com a punt de partida per la realització de l’algorisme de la tesi doctoral no finalitzada de Jose Antonio Soria. Aquesta interfície desenvolupada accepta la incorporació de nous paquets i funcions. Hem deixat un menú preparat per integrar Sinus IV packet transform i Cosine IV packet transform, tot i que també podem incorporar-n’hi altres. L’aplicació consta de dues interfícies, un Assistent i una interfície principal. També hem creat una finestra per importar i exportar les variables desitjades a diferents entorns. Per fer aquesta aplicació s’han programat tots els elements de les finestres, en lloc d’utilitzar el GUIDE (Graphical User Interface Development Enviroment) de MATLAB, per tal que sigui compatible entre les diferents versions d’aquest programa. En total hem fet 73 funcions en la interfície principal (d’aquestes, 10 pertanyen a la finestra d’importar i exportar) i 23 en la de l’Assistent. En aquest treball només explicarem 6 funcions i les 3 de creació d’aquestes interfícies per no fer-lo excessivament extens. Les funcions que explicarem són les més importants, ja sigui perquè s’utilitzen sovint, perquè, segons la complexitat McCabe, són les més complicades o perquè són necessàries pel processament del senyal. Passem cada entrada de dades per part de l’usuari per funcions que ens detectaran errors en aquesta entrada, com eliminació de zeros o de caràcters que no siguin números, com comprovar que són enters o que estan dins dels límits màxims i mínims que li pertoquen.

Programació d'una aplicació gràfica per l'anàlisi de senyals usant LDB (Local Discriminant Bases) i MLDB (Modified LDB)

Tot seguit presentem un entorn per analitzar senyals de tot tipus amb LDB (Local Discriminant Bases) i MLDB (Modified Local Discriminant Bases). Aquest entorn utilitza funcions desenvolupades en el marc d’una tesi en fase de desenvolupament. Per entendre part d’aquestes funcions es requereix un nivell de coneixement avançat de processament de senyals. S’han extret dels treballs realitzats per Naoki Saito [3], que s’han agafat com a punt de partida per la realització de l’algorisme de la tesi doctoral no finalitzada de Jose Antonio Soria. Aquesta interfície desenvolupada accepta la incorporació de nous paquets i funcions. Hem deixat un menú preparat per integrar Sinus IV packet transform i Cosine IV packet transform, tot i que també podem incorporar-n’hi altres. L’aplicació consta de dues interfícies, un Assistent i una interfície principal. També hem creat una finestra per importar i exportar les variables desitjades a diferents entorns. Per fer aquesta aplicació s’han programat tots els elements de les finestres, en lloc d’utilitzar el GUIDE (Graphical User Interface Development Enviroment) de MATLAB, per tal que sigui compatible entre les diferents versions d’aquest programa. En total hem fet 73 funcions en la interfície principal (d’aquestes, 10 pertanyen a la finestra d’importar i exportar) i 23 en la de l’Assistent. En aquest treball només explicarem 6 funcions i les 3 de creació d’aquestes interfícies per no fer-lo excessivament extens. Les funcions que explicarem són les més importants, ja sigui perquè s’utilitzen sovint, perquè, segons la complexitat McCabe, són les més complicades o perquè són necessàries pel processament del senyal. Passem cada entrada de dades per part de l’usuari per funcions que ens detectaran errors en aquesta entrada, com eliminació de zeros o de caràcters que no siguin números, com comprovar que són enters o que estan dins dels límits màxims i mínims que li pertoquen.

Efficiency of evolutionary algorithms in water network pipe sizing

The pipe sizing of water networks via evolutionary algorithms is of great interest because it allows the selection of alternative economical solutions that meet a set of design requirements. However, available evolutionary methods are numerous, and methodologies to compare the performance of these methods beyond obtaining a minimal solution for a given problem are currently lacking. A methodology to compare algorithms based on an efficiency rate (E) is presented here and applied to the pipe-sizing problem of four medium-sized benchmark networks (Hanoi, New York Tunnel, GoYang and R-9 Joao Pessoa). E numerically determines the performance of a given algorithm while also considering the quality of the obtained solution and the required computational effort. From the wide range of available evolutionary algorithms, four algorithms were selected to implement the methodology: a PseudoGenetic Algorithm (PGA), Particle Swarm Optimization (PSO), a Harmony Search and a modified Shuffled Frog Leaping Algorithm (SFLA). After more than 500,000 simulations, a statistical analysis was performed based on the specific parameters each algorithm requires to operate, and finally, E was analyzed for each network and algorithm. The efficiency measure indicated that PGA is the most efficient algorithm for problems of greater complexity and that HS is the most efficient algorithm for less complex problems. However, the main contribution of this work is that the proposed efficiency ratio provides a neutral strategy to compare optimization algorithms and may be useful in the future to select the most appropriate algorithm for different types of optimization problems.

Modified Chebyshev algorithm: some applications

Two applications of the modified Chebyshev algorithm are considered. The first application deals with the generation of orthogonal polynomials associated with a weight function having singularities on or near the end points of the interval of orthogonality. The other application involves the generation of real Szego polynomials.

An implementation of modified scatter search algorithm to transmission expansion planning

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Reconfiguration of distribution systems by a modified genetic algorithm

In this paper a genetic algorithm based reconfiguration method is proposed to minimize the real power losses of distribution systems. The main innovation of this research work is that new types of crossover and mutation operators are proposed, such that the best possible results are obtained, with an acceptable computational effort. The crossover and mutation operators were developed so as to take advantage of the particular characteristics of distribution systems (as the radial topology). Simulation results indicate that the proposed method is very efficient, being able to find excellent configurations, with low computational effort, especially for larger systems. ©2007 IEEE.

An application of a modified constructive heuristic algorithm to transmission expansion planning

Transmission expansion planning (TEP) is a non-convex optimization problem that can be solved via different heuristic algorithms. A variety of classical as well as heuristic algorithms in literature are addressed to solve TEP problem. In this paper a modified constructive heuristic algorithm (CHA) is proposed for solving such a crucial problem. Most of research papers handle TEP problem by linearization of the non-linear mathematical model while in this research TEP problem is solved via CHA using non-linear model. The proposed methodology is based upon Garver's algorithm capable of applying to a DC model. Simulation studies and tests results on the well known transmission network such as: Garver and IEEE 24-bus systems are carried out to show the significant performance as well as the effectiveness of the proposed algorithm. © 2011 IEEE.

Dynamics characterization of modified Gross-Pitaevskii equation

The dynamics of dissipative and coherent N-body systems, such as a Bose-Einstein condensate, which can be described by an extended Gross-Pitaevskii formalism, is investigated. In order to analyze chaotic and unstable regimes, two approaches are considered: a metric one, based on calculations of Lyapunov exponents, and an algorithmic one, based on the Lempel-Ziv criterion. The consistency of both approaches is established, with the Lempel-Ziv algorithmic found as an efficient complementary approach to the metric one for the fast characterization of dynamical behaviors obtained from finite sequences. © 2013 Elsevier B.V. All rights reserved.

Evaluation of operational SSM/I ice-concentration algorithms

The United States National Ice Center (NIC) provides weekly ice analyses of the Arctic and Antarctic using information from ice reconnaissance, ship reports and high-resolution satellite imagery. In cloud-covered areas and regions lacking imagery, the higher-resolution sources are augmented by ice concentrations derived from Defense Meteorological Satellite Program (DMSP) Special Sensor Microwave/Imager (SSMII) passive-microwave imagery. However, the SSMII-derived ice concentrations are limited by low resolution and uncertainties in thin-ice regions. Ongoing research at NIC is attempting to improve the utility of these SSMII products for operational sea-ice analyses. The refinements of operational algorithms may also aid future scientific studies. Here we discuss an evaluation of the standard operational ice-concentration algorithm, Cal/Val, with a possible alternative, a modified NASA Team algorithm. The modified algorithm compares favorably with CallVal and is a substantial improvement over the standard NASA Team algorithm in thin-ice regions that are of particular interest to operational activities.