Asynchronous expression of myeloid antigens in leukemic cells in a PML/RARalpha transgenic mouse model

Acute promyelocytic leukemia (APL) is characterized by the expansion of blasts that resemble morphologically promyelocytes and harbor a chromosomal translocation involving the retinoic acid receptor a (RARa) and the promyelocytic leukemia (PML) genes on chromosomes 17 and 15, respectively. The expression of the PML/RARa fusion gene is essential for APL genesis. In fact, transgenic mice (TM) expressing PML/RARa develop a form of leukemia that mimics the hematological findings of human APL. Leukemia is diagnosed after a long latency (approximately 12 months) during which no hematological abnormality is detected in peripheral blood (pre-leukemic phase). In humans, immunophenotypic analysis of APL blasts revealed distinct features; however, the precise immunophenotype of leukemic cells in the TM model has not been established. Our aim was to characterize the expression of myeloid antigens by leukemic cells from hCG-PML/RARa TM. In this study, TM (N = 12) developed leukemia at the mean age of 13.1 months. Morphological analysis of bone marrow revealed an increase of the percentage of immature myeloid cells in leukemic TM compared to pre-leukemic TM and wild-type controls (48.63 ± 16.68, 10.83 ± 8.11, 7.4 ± 5.46%, respectively; P < 0.05). Flow cytometry analysis of bone marrow and spleen from leukemic TM identified the asynchronous co-expression of CD34, CD117, and CD11b. This abnormal phenotype was rarely detected prior to the diagnosis of leukemia and was present at similar frequencies in hematologically normal TM and wild-type controls of different ages. The present results demonstrate that, similarly to human APL, leukemic cells from hCG-PML/RARa TM present a specific immunophenotype.

Computing Generators of Free Modules over Orders in Group Algebras

Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case that the Wedderburn decomposition E[G] \cong \oplus_xM_x is explicitly computable and each M_x is in fact a matrix ring over a field, this leads to an algorithm that either gives elements \alpha_1,...,\alpha_d \in X such that X = A\alpha_1 \oplus ... \oplusA\alpha_d or determines that no such elements exist. Let L/K be a finite Galois extension of number fields with Galois group G such that E is a subfield of K and put d = [K : E]. The algorithm can be applied to certain Galois modules that arise naturally in this situation. For example, one can take X to be O_L, the ring of algebraic integers of L, and A to be the associated order A(E[G];O_L) \subseteq E[G]. The application of the algorithm to this special situation is implemented in Magma under certain extra hypotheses when K = E = \IQ.

Learning generators : NLP and learning styles in english text books. 'Generadores de aprendizaje : PNL y estilos de aprendizaje en libros de texto de ingl??s'

Resumen basado en el de la publicaci??n

Evaluating the performance of external fault ridethrough solutions used in wind farms with fixed speed induction generators when facing unbalanced faults

Na sequência da integração da energia eólica em larga escala foram estabelecidos códigos de rede pelos vários operadores de sistema, exigindo que os parques eólicos permaneçam em serviço durante e após a ocorrência de defeitos na rede a montante. Nos parques eólicos equipados com sistemas de velocidade constante este requisito pode ser assegurado pela instalação, no ponto de interligação à rede, de equipamento de compensação dinâmica de potência reactiva, controlado como fonte de tensão, sendo as funções de controlo baseadas em medidas efectuadas no ponto de interligação relativamente às componentes directas da tensão e da corrente. Como a adopção deste tipo de soluções externas é adequada ao funcionamento do sistema em regime equilibrado, este artigo foca a avaliação do desempenho da solução no caso da ocorrência de defeitos assimétricos. Os resultados obtidos através das simulações dinâmicas evidenciam o aparecimento de sobre tensões nas fases não afectadas pelo defeito que poderão colocar o parque eólico fora de serviço.

Nitrogen recycling through the gut and the nitrogen economy of ruminants: An asynchronous symbiosis

The extensive development of the ruminant forestomach sets apart their N economy from that of nonruminants in a number of respects. Extensive pregastric fermentation alters the profile of protein reaching the small intestine, largely through the transformation of nitrogenous compounds into microbial protein. This process is fueled primarily by carbohydrate fermentation and includes extensive recycling of N between the body and gut lumen pools. Nitrogen recycling occurs via blood and gut lumen exchanges of urea and NH3, as well as endogenous gut and secretory N entry into the gut lumen, and the subsequent digestion and absorption of microbial and endogenous protein. Factors controlling urea transfer to the gut from blood, including the contributions of urea transporters, remain equivocal. Ammonia produced by microbial degradation of urea and dietary and endogenous AA is utilized by microbial fermentation or absorbed and primarily converted to urea. Therefore, microbial growth and carbohydrate fermentation affect the extent of NH3 absorption and urea N recycling and excretion. The extensive recycling of N to the rumen represents an evolutionary advantage of the ruminant in terms of absorbable protein supply during periods of dietary protein deficiency, or asynchronous carbohydrate and protein supply, but incurs a cost of greater N intakes, especially in terms of excess N excretion. Efforts to improve the efficiency of N utilization in ruminants by synchronizing fermentable energy and N availability have generally met with limited success with regards to production responses. In contrast, imposing asynchrony through oscillating dietary protein concentration, or infrequent supplementation, surprisingly has not negatively affected production responses unless the frequency of supplementation is less than once every 3 d. In some cases, oscillation of dietary protein concentration has improved N retention compared with animals fed an equal amount of dietary protein on a daily basis. This may reflect benefits of Orn cycle adaptations and sustained recycling of urea to the gut. The microbial symbiosis of the ruminant is inherently adaptable to asynchronous N and energy supply. Recycling of urea to the gut buffers the effect of irregular dietary N supply such that intuitive benefits of rumen synchrony in terms of the efficiency of N utilization are typically not observed in practice.

Instance generators and test suites for the multiobjective quadratic assignment problem

We describe, and make publicly available, two problem instance generators for a multiobjective version of the well-known quadratic assignment problem (QAP). The generators allow a number of instance parameters to be set, including those controlling epistasis and inter-objective correlations. Based on these generators, several initial test suites are provided and described. For each test instance we measure some global properties and, for the smallest ones, make some initial observations of the Pareto optimal sets/fronts. Our purpose in providing these tools is to facilitate the ongoing study of problem structure in multiobjective (combinatorial) optimization, and its effects on search landscape and algorithm performance.

Performance of asynchronous channel assignment scheme in non-uniform and dynamic topology WLANs

Dense deployments of wireless local area networks (WLANs) are fast becoming a permanent feature of all developed cities around the world. While this increases capacity and coverage, the problem of increased interference, which is exacerbated by the limited number of channels available, can severely degrade the performance of WLANs if an effective channel assignment scheme is not employed. In an earlier work, an asynchronous, distributed and dynamic channel assignment scheme has been proposed that (1) is simple to implement, (2) does not require any knowledge of the throughput function, and (3) allows asynchronous channel switching by each access point (AP). In this paper, we present extensive performance evaluation of this scheme when it is deployed in the more practical non-uniform and dynamic topology scenarios. Specifically, we investigate its effectiveness (1) when APs are deployed in a nonuniform fashion resulting in some APs suffering from higher levels of interference than others and (2) when APs are effectively switched `on/off' due to the availability/lack of traffic at different times, which creates a dynamically changing network topology. Simulation results based on actual WLAN topologies show that robust performance gains over other channel assignment schemes can still be achieved even in these realistic scenarios.

An asynchronous channel assignment scheme: performance evaluation

Due to its popularity, dense deployments of wireless local area networks (WLANs) are becoming a common feature of many cities around the world. However, with only a limited number of channels available, the problem of increased interference can severely degrade the performance of WLANs if an effective channel assignment scheme is not employed. In an earlier work, we proposed an improved asynchronous distributed and dynamic channel assignment scheme that (1) is simple to implement, (2) does not require any knowledge of the throughput function, and (3) allows asynchronous channel switching by each access point (AP). In this paper, we present extensive performance evaluation of the proposed scheme in practical scenarios found in densely populated WLAN deployments. Specifically, we investigate the convergence behaviour of the scheme and how its performance gains vary with different number of available channels and in different deployment densities. We also prove that our scheme is guaranteed to converge in a single iteration when the number of channels is greater than the number of neighbouring APs.

Effectiveness of asynchronous channel assignment scheme in heterogeneous WLANs

Due to their popularity, dense deployments of wireless local area networks (WLANs) are becoming a common feature of many cities around the world. However, with only a limited number of channels available, the problem of increased interference can severely degrade the performance of WLANs if an effective channel assignment scheme is not employed. Previous studies on channel assignment in WLANs almost always assume that all access points (AP) employ the same channel assignment scheme which is clearly unrealistic. On the other hand, to the best of our knowledge, the interaction between different channel assignment schemes has also not been studied before. Therefore, in this paper, we investigate the effectiveness of our earlier proposed asynchronous channel assignment scheme in these heterogeneous WLANs scenarios. Simulation results show that our proposed scheme is still able to provide robust performance gains even in these scenarios.

An asynchronous distributed dynamic channel assignment scheme for dense WLANs

Wireless local area networks (WLANs) have changed the way many of us communicate, work, play and live. Due to its popularity, dense deployments are becoming a norm in many cities around the world. However, increased interference and traffic demands can severely limit the aggregate throughput achievable if an effective channel assignment scheme is not used. In this paper, we propose an enhanced asynchronous distributed and dynamic channel assignment scheme that is simple to implement, does not require any knowledge of the throughput function, allows asynchronous channel switching by each access point (AP) and is superior in performance. Simulation results show that our proposed scheme converges much faster than previously reported synchronous schemes, with a reduction in convergence time and channel switches by tip to 73.8% and 30.0% respectively.

Examining random number generators used in stochastic iteration algorithms

This paper investigates random number generators in stochastic iteration algorithms that require infinite uniform sequences. We take a simple model of the general transport equation and solve it with the application of a linear congruential generator, the Mersenne twister, the mother-of-all generators, and a true random number generator based on quantum effects. With this simple model we show that for reasonably contractive operators the theoretically not infinite-uniform sequences perform also well. Finally, we demonstrate the power of stochastic iteration for the solution of the light transport problem.