Representations of lattice point sets : theory, algorithms, applications

Magdeburg, Univ., Fak. für Mathematik, Habil.-Schr., 2006

AvBandTest – a Testing Tool for Implementations of Available Band width Estimation Algorithms

This work describes a test tool that allows to make performance tests of different end-to-end available bandwidth estimation algorithms along with their different implementations. The goal of such tests is to find the best-performing algorithm and its implementation and use it in congestion control mechanism for high-performance reliable transport protocols. The main idea of this paper is to describe the options which provide available bandwidth estimation mechanism for highspeed data transport protocols and to develop basic functionality of such test tool with which it will be possible to manage entities of test application on all involved testing hosts, aided by some middleware.

Efficiency Comparison of DFT/IDFT Algorithms by Evaluating Diverse Hardware Implementations

In this paper we investigate various algorithms for performing Fast Fourier Transformation (FFT)/Inverse Fast Fourier Transformation (IFFT), and proper techniques for maximizing the FFT/IFFT execution speed, such as pipelining or parallel processing, and use of memory structures with pre-computed values (look up tables -LUT) or other dedicated hardware components (usually multipliers). Furthermore, we discuss the optimal hardware architectures that best apply to various FFT/IFFT algorithms, along with their abilities to exploit parallel processing with minimal data dependences of the FFT/IFFT calculations. An interesting approach that is also considered in this paper is the application of the integrated processing-in-memory Intelligent RAM (IRAM) chip to high speed FFT/IFFT computing. The results of the assessment study emphasize that the execution speed of the FFT/IFFT algorithms is tightly connected to the capabilities of the FFT/IFFT hardware to support the provided parallelism of the given algorithm. Therefore, we suggest that the basic Discrete Fourier Transform (DFT)/Inverse Discrete Fourier Transform (IDFT) can also provide high performances, by utilizing a specialized FFT/IFFT hardware architecture that can exploit the provided parallelism of the DFT/IDF operations. The proposed improvements include simplified multiplications over symbols given in polar coordinate system, using sinе and cosine look up tables, and an approach for performing parallel addition of N input symbols.

Efficiency Comparison of DFT/IDFT Algorithms by Evaluating Diverse Hardware : Implementations,Parallelization Prospectsand Possible Improvements

In this paper we investigate various algorithms for performing Fast Fourier Transformation (FFT)/Inverse Fast Fourier Transformation (IFFT), and proper techniquesfor maximizing the FFT/IFFT execution speed, such as pipelining or parallel processing, and use of memory structures with pre-computed values (look up tables -LUT) or other dedicated hardware components (usually multipliers). Furthermore, we discuss the optimal hardware architectures that best apply to various FFT/IFFT algorithms, along with their abilities to exploit parallel processing with minimal data dependences of the FFT/IFFT calculations. An interesting approach that is also considered in this paper is the application of the integrated processing-in-memory Intelligent RAM (IRAM) chip to high speed FFT/IFFT computing. The results of the assessment study emphasize that the execution speed of the FFT/IFFT algorithms is tightly connected to the capabilities of the FFT/IFFT hardware to support the provided parallelism of the given algorithm. Therefore, we suggest that the basic Discrete Fourier Transform (DFT)/Inverse Discrete Fourier Transform (IDFT) can also provide high performances, by utilizing a specialized FFT/IFFT hardware architecture that can exploit the provided parallelism of the DFT/IDF operations. The proposed improvements include simplified multiplications over symbols given in polar coordinate system, using sinе and cosine look up tables,and an approach for performing parallel addition of N input symbols.

Practical Aspects of Genetic Algorithms’ Implementation in Life Cycle Management of Electrotechnical Equipment

Some practical aspects of Genetic algorithms’ implementation regarding to life cycle management of electrotechnical equipment are considered.

Investigating polyhedra by oracles and analyzing simple extensions of polytopes

Otto-von-Guericke-Universität Magdeburg, Fakultät für Mathematik, Dissertation, 2016

Can genetic algorithms explain experimental anomalies? An application to common property resources

It is common to find in experimental data persistent oscillations in the aggregate outcomes and high levels of heterogeneity in individual behavior. Furthermore, it is not unusual to find significant deviations from aggregate Nash equilibrium predictions. In this paper, we employ an evolutionary model with boundedly rational agents to explain these findings. We use data from common property resource experiments (Casari and Plott, 2003). Instead of positing individual-specific utility functions, we model decision makers as selfish and identical. Agent interaction is simulated using an individual learning genetic algorithm, where agents have constraints in their working memory, a limited ability to maximize, and experiment with new strategies. We show that the model replicates most of the patterns that can be found in common property resource experiments.

Two algorithms to find a power integral basis

"Vegeu el resum a l'inici del fitxer adjunt."

A simple method to purify biologically and antigenically preserved bloodstream trypomastigotes of Trypanosoma cruzi using Deae-cellulose columns

A method to purify trypanosomastigotes of some strains of Trypanosoma cruzi (Y, CL, FL, F, "Berenice", "Colombiana" and "São Felipe") from mouse blood by using DEAE-cellulose columns was standardized. This procedure is a modification of the Lanham & Godfrey methods and differs in some aspects from others described to purify T. cruzi bloodstream trypomastigotes, mainly by avoidance of prior purifications of parasites. By this method, the broad trypomastigotes were mainly isolated, accounting for higher recoveries obtained with strains having higher percentages of these forms: processing of infected blood from irradiated mice could be advantageous by increasing the recovery of parasites (percentage and/or total number) and elution of more slender trypomastigotes. Trypomastigotes purified by this method presented normal morphology and motility, remained infective to triatomine bugs and mice, showing in the latter prepatent periods and courses parasitemia similar to those of control parasites, and also reproducing the polymorphism pattern of each strain. Their virulence and pathogenicity also remained considerably preserved, the latter property being evaluated by LD 50 tests, mortality rates and mean survival time of inoculated mice. Moreover, these parasites presented positive, clear and peripheral immunofluorescence reaction at titres similar to those of control organisms, thus suggesting important preservation of their surface antigens.

A simple method for assessing the binding of concanavalin A to mononuclear cell surfaces: no interference of visceral leishmaniasis serum on this binding

We report a simple method for evaluating the binding of concanavalin A (ConA) to human peripheral blood mononuclear cells (PBMC). The binding is evidenced by an immunoenzymic assay using peroxidase-conjugated immunoglobulins of a rabbit anti-ConA serum. Using the method we show that sera from patients with American leishmaniasis do not interfere with binding of ConA to PBMC.

Análisis y diseño de un procesador RISC simple para adquisición y proceso de datos

Aquest projecte té com a objectiu l'anàlisi de prestacions de processadors RISC de baix cost i el disseny d'un processador RISC simple per a aplicacions de propòsit general relacionades amb l'adquisició i el procés simple de dades. Com a resultat es presenta el processador SR3C de 32 bits i arquitectura RISC. Aquest processador s'ha descrit i simulat mitjançant el llenguatge de descripció de hardware VHDL i s'ha sintetitzat en una FPGA. El processador està preparat per poder utilitzar-se en SoCs reals gràcies al compliment de l'estàndard de busos Wishbone. A més també es pot utilitzar com plataforma educativa gràcies a l'essamblador i simulador desenvolupats.

PulseCath iVAC 3LTM hemodynamic performance for simple assisted flow.

The PulseCath iVAC 3L? left ventricular assist device is an option to treat transitory left heart failure or dysfunction post-cardiac surgery. Assisted blood flow should reach up to 3 l/min. In the present in vitro model exact pump flow, depending on various frequencies and afterload was examined. Optimal flow was achieved with inflation/deflation frequencies of about 70-80/min. The maximal flow rate was achieved at about 2.5 l/min with a minimal afterload of 22 mmHg. Handling of the device was easy due to the connection to a standard intra-aortic balloon pump console. With increasing afterload (up to a simulated mean systemic pressure of 66 mmHg) flow rate and cardiac support are in some extent limited.

A simple genetic basis for complex social behaviour mediates widespread gene expression differences.

A remarkable social polymorphism is controlled by a single Mendelian factor in the fire ant Solenopsis invicta. A genomic element marked by the gene Gp-9 determines whether workers tolerate one or many fertile queens in their colony. Gp-9 was recently shown to be part of a supergene with two nonrecombining variants, SB and Sb. SB/SB and SB/Sb queens differ in how they initiate new colonies, and in many physiological traits, for example odour and maturation rate. To understand how a single genetic element can affect all these traits, we used a microarray to compare gene expression patterns between SB/SB and SB/Sb queens of three different age classes: 1-day-old unmated queens, 11-day-old unmated queens and mated, fully reproductive queens collected from mature field colonies. The number of genes that were differentially expressed between SB/SB and SB/Sb queens of the same age class was smallest in 1-day-old queens, maximal in 11-day-old queens and intermediate in reproductive queens. Gene ontology analysis showed that SB/SB queens upregulate reproductive genes faster than SB/Sb queens. For all age classes, genes inside the supergene were overrepresented among the differentially expressed genes. Consistent with the hypothesized greater number of transposons in the Sb supergene, 13 transposon genes were upregulated in SB/Sb queens. Viral genes were also upregulated in SB/Sb mature queens, consistent with the known greater parasite load in colonies headed by SB/Sb queens compared with colonies headed by SB/SB queens. Eighteen differentially expressed genes between reproductive queens were involved in chemical signalling. Our results suggest that many genes in the supergene are involved in regulating social organization and queen phenotypes in fire ants.