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.

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."

Diagnostic d'embolie pulmonaire: problématique résiduelle des D-dimères faussement positifs [The unresolved issue of false-positive D-dimer results in the diagnostic workup of pulmonary embolism].

The unresolved issue of false-positive D-dimer results in the diagnostic workup of pulmonary embolism Pulmonary embolism (PE) remains a difficult diagnosis as it lacks specific symptoms and clinical signs. After the determination of the pretest PE probability by a validated clinical score, D-dimers (DD) is the initial blood test in the majority of patients whose probability is low or intermediate. The low specificity of DD results in a high number of false-positives that then require thoracic angio-CT. A new clinical decision rule, called the Pulmonary Embolism Rule-out criteria (PERC), identifies patients at such low risk that PE can be safely ruled-out without a DD test. Its safety has been confirmed in US emergency departments, but retrospective European studies showed that it would lead to 5-7% of undiagnosed PE. Alternative strategies are needed to reduce the proportion of false-positive DD results.

Safety and immunogenicity of the M72/AS01 candidate tuberculosis vaccine in HIV-infected adults on combination antiretroviral therapy: a phase I/II, randomized trial.

OBJECTIVE: Tuberculosis (TB) is highly prevalent among HIV-infected people, including those receiving combination antiretroviral therapy (cART), necessitating a well tolerated and efficacious TB vaccine for these populations. We evaluated the safety and immunogenicity of the candidate TB vaccine M72/AS01 in adults with well controlled HIV infection on cART. DESIGN: A randomized, observer-blind, controlled trial (NCT00707967). METHODS: HIV-infected adults on cART in Switzerland were randomized 3 : 1 : 1 to receive two doses, 1 month apart, of M72/AS01, AS01 or 0.9% physiological saline (N = 22, N = 8 and N = 7, respectively) and were followed up to 6 months postdose 2 (D210). Individuals with CD4⁺ cell counts below 200 cells/μl were excluded. Adverse events (AEs) including HIV-specific and laboratory safety parameters were recorded. Cell-mediated (ICS) and humoral (ELISA) responses were evaluated before vaccination, 1 month after each dose (D30, D60) and D210. RESULTS: Thirty-seven individuals [interquartile range (IQR) CD4⁺ cell counts at screening: 438-872 cells/μl; undetectable HIV-1 viremia] were enrolled; 73% of individuals reported previous BCG vaccination, 97.3% tested negative for the QuantiFERON-TB assay. For M72/AS01 recipients, no vaccine-related serious AEs or cART-regimen adjustments were recorded, and there were no clinically relevant effects on laboratory safety parameters, HIV-1 viral loads or CD4⁺ cell counts. M72/AS01 was immunogenic, inducing persistent and polyfunctional M72-specific CD4⁺ T-cell responses [medians 0.70% (IQR 0.37-1.07) at D60] and 0.42% (0.24-0.61) at D210, predominantly CD40L⁺IL-2⁺TNF-α⁺, CD40L⁺IL-2⁺ and CD40L⁺IL-2⁺TNF-α⁺IFN-γ⁺]. All M72/AS01 vaccines were seropositive for anti-M72 IgG after second vaccination until study end. CONCLUSION: M72/AS01 was clinically well tolerated and immunogenic in this population, supporting further clinical evaluation in HIV-infected individuals in TB-endemic settings.

Pharmacokinetics and safety of panobacumab: specific adjunctive immunotherapy in critical patients with nosocomial Pseudomonas aeruginosa O11 pneumonia.

Objectives Nosocomial Pseudomonas aeruginosa pneumonia remains a major concern in critically ill patients. We explored the potential impact of microorganism-targeted adjunctive immunotherapy in such patients. Patients and methods This multicentre, open pilot Phase 2a clinical trial (NCT00851435) prospectively evaluated the safety, pharmacokinetics and potential efficacy of three doses of 1.2 mg/kg panobacumab, a fully human monoclonal anti-lipopolysaccharide IgM, given every 72 h in 18 patients developing nosocomial P. aeruginosa (serotype O11) pneumonia. Results Seventeen out of 18 patients were included in the pharmacokinetic analysis. In 13 patients receiving three doses, the maximal concentration after the third infusion was 33.9 ± 8.0 μg/mL, total area under the serum concentration-time curve was 5397 ± 1993 μg h/mL and elimination half-life was 102.3 ± 47.8 h. Panobacumab was well tolerated, induced no immunogenicity and was detected in respiratory samples. In contrast to Acute Physiology and Chronic Health Evaluation II (APACHE II) prediction, all 13 patients receiving three doses survived, with a mean clinical resolution in 9.0 ± 2.7 days. Two patients suffered a recurrence at days 17 and 20. Conclusions These data suggest that panobacumab is safe, with a pharmacokinetic profile similar to that in healthy volunteers. It was associated with high clinical cure and survival rates in patients developing nosocomial P. aeruginosa O11 pneumonia. We concluded that these promising results warrant further trials.

A Model-to-model analysis of the repeated Prisoners' Dilemma: genetic algorithms vs. evolutionary dynamics

We study the properties of the well known Replicator Dynamics when applied to a finitely repeated version of the Prisoners' Dilemma game. We characterize the behavior of such dynamics under strongly simplifying assumptions (i.e. only 3 strategies are available) and show that the basin of attraction of defection shrinks as the number of repetitions increases. After discussing the difficulties involved in trying to relax the 'strongly simplifying assumptions' above, we approach the same model by means of simulations based on genetic algorithms. The resulting simulations describe a behavior of the system very close to the one predicted by the replicator dynamics without imposing any of the assumptions of the analytical model. Our main conclusion is that analytical and computational models are good complements for research in social sciences. Indeed, while on the one hand computational models are extremely useful to extend the scope of the analysis to complex scenar

Multi-scale support vector algorithms for hot spot detection and modelling

The algorithmic approach to data modelling has developed rapidly these last years, in particular methods based on data mining and machine learning have been used in a growing number of applications. These methods follow a data-driven methodology, aiming at providing the best possible generalization and predictive abilities instead of concentrating on the properties of the data model. One of the most successful groups of such methods is known as Support Vector algorithms. Following the fruitful developments in applying Support Vector algorithms to spatial data, this paper introduces a new extension of the traditional support vector regression (SVR) algorithm. This extension allows for the simultaneous modelling of environmental data at several spatial scales. The joint influence of environmental processes presenting different patterns at different scales is here learned automatically from data, providing the optimum mixture of short and large-scale models. The method is adaptive to the spatial scale of the data. With this advantage, it can provide efficient means to model local anomalies that may typically arise in situations at an early phase of an environmental emergency. However, the proposed approach still requires some prior knowledge on the possible existence of such short-scale patterns. This is a possible limitation of the method for its implementation in early warning systems. The purpose of this paper is to present the multi-scale SVR model and to illustrate its use with an application to the mapping of Cs137 activity given the measurements taken in the region of Briansk following the Chernobyl accident.