Nasal immunization of mice with Lactobacillus casei expressing the Pneumococcal Surface Protein A: induction of antibodies, complement deposition and partial protection against Streptococcus pneumoniae challenge

Strategies for the development of new vaccines against Streptococcus pneumoniae infections try to overcome problems such as serotype coverage and high costs, present in currently available vaccines. Formulations based on protein candidates that can induce protection in animal models have been pointed as good alternatives. Among them, the Pneumococcal Surface Protein A (PspA) plays an important role during systemic infection at least in part through the inhibition of complement deposition on the pneumococcal surface, a mechanism of evasion from the immune system. Antigen delivery systems based on live recombinant lactic acid bacteria (LAB) represents a promising strategy for mucosal vaccination, since they are generally regarded as safe bacteria able to elicit both systemic and mucosal immune responses. In this work, the N-terminal region of clade I PspA was constitutively expressed in Lactobacillus casei and the recombinant bacteria was tested as a mucosal vaccine in mice. Nasal immunization with L. casei-PspA 1 induced anti-PspA antibodies that were able to bind to pneumococcal strains carrying both clade 1 and clade 2 PspAs and to induce complement deposition on the surface of the bacteria. In addition, an increase in survival of immunized mice after a systemic challenge with a virulent pneumococcal strain was observed. (C) 2008 Elsevier Masson SAS. All rights reserved.

Pharmacogenetics of Warfarin: Development of a Dosing Algorithm for Brazilian Patients

A dosing algorithm including genetic (VKORC1 and CYP2C9 genotypes) and nongenetic factors (age, weight, therapeutic indication, and cotreatment with amiodarone or simvastatin) explained 51% of the variance in stable weekly warfarin doses in 390 patients attending an anticoagulant clinic in a Brazilian public hospital. The VKORC1 3673G>A genotype was the most important predictor of warfarin dose, with a partial R(2) value of 23.9%. Replacing the VKORC1 3673G>A genotype with VKORC1 diplotype did not increase the algorithm`s predictive power. We suggest that three other single-nucleotide polymorphisms (SNPs) (5808T>G, 6853G>C, and 9041G>A) that are in strong linkage disequilibrium (LD) with 3673G>A would be equally good predictors of the warfarin dose requirement. The algorithm`s predictive power was similar across the self-identified ""race/color"" subsets. ""Race/color"" was not associated with stable warfarin dose in the multiple regression model, although the required warfarin dose was significantly lower (P = 0.006) in white (29 +/- 13 mg/week, n = 196) than in black patients (35 +/- 15 mg/week, n = 76).

Signal Processing and patternrecognition algorithm for monitoringParkinson’s disease.

This masters thesis describes the development of signal processing and patternrecognition in monitoring Parkison’s disease. It involves the development of a signalprocess algorithm and passing it into a pattern recogniton algorithm also. Thesealgorithms are used to determine , predict and make a conclusion on the study ofparkison’s disease. We get to understand the nature of how the parkinson’s disease isin humans.

Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing

This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. The goal is to solve the transportation problem, to be able to deliver the packages-on time for the customers,-enough package for each Customer,-using the available resources- and – of course - to be so effective as it is possible.Although this problem seems to be very easy to solve with a small number of cities or customers, it is not. In this problem the algorithm have to face with several constraints, for example opening hours, package delivery times, truck capacities, etc. This makes this problem a so called Multi Constraint Optimization Problem (MCOP). What’s more, this problem is intractable with current amount of computational power which is available for most of us. As the number of customers grow, the calculations to be done grows exponential fast, because all constraints have to be solved for each customers and it should not be forgotten that the goal is to find a solution, what is best enough, before the time for the calculation is up. This problem is introduced in the first chapter: form its basics, the Traveling Salesman Problem, using some theoretical and mathematical background it is shown, why is it so hard to optimize this problem, and although it is so hard, and there is no best algorithm known for huge number of customers, why is it a worth to deal with it. Just think about a huge transportation company with ten thousands of trucks, millions of customers: how much money could be saved if we would know the optimal path for all our packages.Although there is no best algorithm is known for this kind of optimization problems, we are trying to give an acceptable solution for it in the second and third chapter, where two algorithms are described: the Genetic Algorithm and the Simulated Annealing. Both of them are based on obtaining the processes of nature and material science. These algorithms will hardly ever be able to find the best solution for the problem, but they are able to give a very good solution in special cases within acceptable calculation time.In these chapters (2nd and 3rd) the Genetic Algorithm and Simulated Annealing is described in details, from their basis in the “real world” through their terminology and finally the basic implementation of them. The work will put a stress on the limits of these algorithms, their advantages and disadvantages, and also the comparison of them to each other.Finally, after all of these theories are shown, a simulation will be executed on an artificial environment of the VRP, with both Simulated Annealing and Genetic Algorithm. They will both solve the same problem in the same environment and are going to be compared to each other. The environment and the implementation are also described here, so as the test results obtained.Finally the possible improvements of these algorithms are discussed, and the work will try to answer the “big” question, “Which algorithm is better?”, if this question even exists.

A Genetic Algorithm for Solar Boat

Genetic algorithm has been widely used in different areas of optimization problems. Ithas been combined with renewable energy domain, photovoltaic system, in this thesis.To participate and win the solar boat race, a control program is needed and C++ hasbeen chosen for programming. To implement the program, the mathematic model hasbeen built. Besides, the approaches to calculate the boundaries related to conditionhave been explained. Afterward, the processing of the prediction and real time controlfunction are offered. The program has been simulated and the results proved thatgenetic algorithm is helpful to get the good results but it does not improve the resultstoo much since the particularity of the solar driven boat project such as the limitationof energy production

Branch and Bound Algorithm for Multiprocessor Scheduling

The multiprocessor task graph scheduling problem has been extensively studied asacademic optimization problem which occurs in optimizing the execution time of parallelalgorithm with parallel computer. The problem is already being known as one of the NPhardproblems. There are many good approaches made with many optimizing algorithmto find out the optimum solution for this problem with less computational time. One ofthem is branch and bound algorithm.In this paper, we propose a branch and bound algorithm for the multiprocessor schedulingproblem. We investigate the algorithm by comparing two different lower bounds withtheir computational costs and the size of the pruned tree.Several experiments are made with small set of problems and results are compared indifferent sections.

University Scheduling using Genetic Algorithm

The automated timetabling and scheduling is one of the hardest problem areas. This isbecause of constraints and satisfying those constraints to get the feasible and optimizedschedule, and it is already proved as an NP Complete (1) [1]. The basic idea behind this studyis to investigate the performance of Genetic Algorithm on general scheduling problem underpredefined constraints and check the validity of results, and then having comparative analysiswith other available approaches like Tabu search, simulated annealing, direct and indirectheuristics [2] and expert system. It is observed that Genetic Algorithm is good solutiontechnique for solving such problems and later analysis will prove this argument. The programis written in C++ and analysis is done by using variation in various parameters.

University Timetabling using Genetic Algorithm

The field of automated timetabling and scheduling meeting all the requirementsthat we call constraints is always difficult task and already proved as NPComplete. The idea behind my research is to implement Genetic Algorithm ongeneral scheduling problem under predefined constraints and check the validityof results, and then I will explain the possible usage of other approaches likeexpert systems, direct heuristics, network flows, simulated annealing and someother approaches. It is observed that Genetic Algorithm is good solutiontechnique for solving such problems. The program written in C++ and analysisis done with using various tools explained in details later.

Identification of cause of impairment in spiral drawings, using non-stationary feature extraction approach

Parkinson’s disease is a clinical syndrome manifesting with slowness and instability. As it is a progressive disease with varying symptoms, repeated assessments are necessary to determine the outcome of treatment changes in the patient. In the recent past, a computer-based method was developed to rate impairment in spiral drawings. The downside of this method is that it cannot separate the bradykinetic and dyskinetic spiral drawings. This work intends to construct the computer method which can overcome this weakness by using the Hilbert-Huang Transform (HHT) of tangential velocity. The work is done under supervised learning, so a target class is used which is acquired from a neurologist using a web interface. After reducing the dimension of HHT features by using PCA, classification is performed. C4.5 classifier is used to perform the classification. Results of the classification are close to random guessing which shows that the computer method is unsuccessful in assessing the cause of drawing impairment in spirals when evaluated against human ratings. One promising reason is that there is no difference between the two classes of spiral drawings. Displaying patients self ratings along with the spirals in the web application is another possible reason for this, as the neurologist may have relied too much on this in his own ratings.

Simulation of Photovoltaic Panel Production as Complement to Ground Source Heat Pump System

This master thesis presents a new technological combination of two environmentally friendly sources of energy in order to provide DHW, and space heating. Solar energy is used for space heating, and DHW production using PV modules which supply direct current directly to electrical heating elements inside a water storage tank. On the other hand a GSHP system as another source of renewable energy provides heat in the water storage tank of the system in order to provide DHW and space heating. These two sources of renewable energy have been combined in this case-study in order to obtain a more efficient system, which will reduce the amount of electricity consumed by the GSHP system.The key aim of this study is to make simulations, and calculations of the amount ofelectrical energy that can be expected to be produced by a certain amount of PV modules that are already assembled on a house in Vantaa, southern Finland. This energy is then intended to be used as a complement to produce hot water in the heating system of the house beside the original GSHP system. Thus the amount of electrical energy purchased from the grid should be reduced and the compressor in the GSHP would need fewer starts which would reduce the heating cost of the GSHP system for space heating and providing hot water.The produced energy by the PV arrays in three different circuits will be charged directly to three electrical heating elements in the water storage tank of the existing system to satisfy the demand of the heating elements. The excess energy can be used to heat the water in the water storage tank to some extent which leads to a reduction of electricity consumption by the different components of the GSHP system.To increase the efficiency of the existing hybrid system, optimization of different PV configurations have been accomplished, and the results are compared. Optimization of the arrays in southern and western walls shows a DC power increase of 298 kWh/year compared with the existing PV configurations. Comparing the results from the optimization of the arrays on the western roof if the intention is to feed AC power to the components of the GSHP system shows a yearly AC power production of 1,646 kWh.This is with the consideration of no overproduction by the PV modules during the summer months. This means the optimized PV systems will be able to cover a larger part of summer demand compared with the existing system.

Spiral drawing during self-rated dyskinesia is more impaired than during self-rated off

Background: A mobile device test battery, consisting of a patient diary collection section with disease-related questions and a fine motor test section (including spiral drawing tasks), was used by 65 patients with advanced Parkinson's disease (PD)(treated with intraduodenal levodopa/carbidopa gel infusion, Duodopa®, or candidates for this treatment) on 10439 test occasions in their home environments. On each occasion, patients traced three pre-drawn Archimedes spirals using an ergonomic stylus and self-assessed their motor function on a global Treatment Response Scale (TRS) ranging from -3 = very 'off' to 0 = 'on' to +3 = very dyskinetic. The spirals were processed by a computer-based method that generates a "spiral score" representing the PD-related drawing impairment. The scale for the score was based on a modified Bain & Findley rating scale in the range from 0 = no impairment to 5 = moderate impairment to 10 = extremely severe impairment. Objective: To analyze the test battery data for the purpose to find differences in spiral drawing performance of PD patients in relation to their self-assessments of motor function. Methods: Three motor states were used in the analysis; OFF state (including moderate and very 'off'), ON state ('on') and a dyskinetic (DYS) state (moderate and very dyskinetic). In order to avoid the problem of multiple test occasions per patient, 200 random samples of single test occasions per patient were drawn. One-way analysis of variance, ANOVA, test followed by Tukey multiple comparisons test was used to test if mean values of spiral test parameters, i.e. the spiral score and drawing completion times (in seconds), were different among the three motor states. Statistical significance was set at p<0.05. To investigate changes in the spiral score over the time-of-day test sessions for the three motor states, plots of statistical summaries were inspected. Results: The mean spiral score differed significantly across the three self-assessed motor states (p<0.001, ANOVA test). Tukey post-hoc comparisons indicate that the mean spiral score (mean ± SD; [95% CI for mean]) in DYS state (5.2 ± 1.8; [5.12, 5.28]) was higher than the mean spiral score in OFF (4.3 ± 1.7; [4.22, 4.37]) and ON (4.2 ± 1.7; [4.17, 4.29]) states. The mean spiral score was also significantly different among individual TRS values of slightly 'off' (4.02 ± 1.63), 'on' (4.07 ± 1.65) and slightly dyskinetic (4.6 ± 1.71), (p<0.001). There were no differences in drawing completion times among the three motor states (p=0.509). In the OFF and ON states, patients drew slightly more impaired spirals in the afternoon whereas in the DYS state the spiral drawing performance was more impaired in the morning. Conclusion: It was found that when patients considered themselves as being dyskinetic spiral drawing was more impaired (nearly one unit change in a 0-10 scale) compared to when they considered themselves as being 'off' and 'on'. The spiral drawing at patients that self-assessed their motor state as dyskinetic was slightly more impaired in the morning hours, between 8 and 12 o'clock, a situation possibly caused by the morning dose effect.

Digital spiral analysis for objective assessment of fine motor timing variability in Parkinson's disease

OBJECTIVES: To develop a method for objective assessment of fine motor timing variability in Parkinson’s disease (PD) patients, using digital spiral data gathered by a touch screen device. BACKGROUND: A retrospective analysis was conducted on data from 105 subjects including65 patients with advanced PD (group A), 15 intermediate patients experiencing motor fluctuations (group I), 15 early stage patients (group S), and 10 healthy elderly subjects (HE) were examined. The subjects were asked to perform repeated upper limb motor tasks by tracing a pre-drawn Archimedes spiral as shown on the screen of the device. The spiral tracing test was performed using an ergonomic pen stylus, using dominant hand. The test was repeated three times per test occasion and the subjects were instructed to complete it within 10 seconds. Digital spiral data including stylus position (x-ycoordinates) and timestamps (milliseconds) were collected and used in subsequent analysis. The total number of observations with the test battery were as follows: Swedish group (n=10079), Italian I group (n=822), Italian S group (n = 811), and HE (n=299). METHODS: The raw spiral data were processed with three data processing methods. To quantify motor timing variability during spiral drawing tasks Approximate Entropy (APEN) method was applied on digitized spiral data. APEN is designed to capture the amount of irregularity or complexity in time series. APEN requires determination of two parameters, namely, the window size and similarity measure. In our work and after experimentation, window size was set to 4 and similarity measure to 0.2 (20% of the standard deviation of the time series). The final score obtained by APEN was normalized by total drawing completion time and used in subsequent analysis. The score generated by this method is hence on denoted APEN. In addition, two more methods were applied on digital spiral data and their scores were used in subsequent analysis. The first method was based on Digital Wavelet Transform and Principal Component Analysis and generated a score representing spiral drawing impairment. The score generated by this method is hence on denoted WAV. The second method was based on standard deviation of frequency filtered drawing velocity. The score generated by this method is hence on denoted SDDV. Linear mixed-effects (LME) models were used to evaluate mean differences of the spiral scores of the three methods across the four subject groups. Test-retest reliability of the three scores was assessed after taking mean of the three possible correlations (Spearman’s rank coefficients) between the three test trials. Internal consistency of the methods was assessed by calculating correlations between their scores. RESULTS: When comparing mean spiral scores between the four subject groups, the APEN scores were different between HE subjects and three patient groups (P=0.626 for S group with 9.9% mean value difference, P=0.089 for I group with 30.2%, and P=0.0019 for A group with 44.1%). However, there were no significant differences in mean scores of the other two methods, except for the WAV between the HE and A groups (P<0.001). WAV and SDDV were highly and significantly correlated to each other with a coefficient of 0.69. However, APEN was not correlated to neither WAV nor SDDV with coefficients of 0.11 and 0.12, respectively. Test-retest reliability coefficients of the three scores were as follows: APEN (0.9), WAV(0.83) and SD-DV (0.55). CONCLUSIONS: The results show that the digital spiral analysis-based objective APEN measure is able to significantly differentiate the healthy subjects from patients at advanced level. In contrast to the other two methods (WAV and SDDV) that are designed to quantify dyskinesias (over-medications), this method can be useful for characterizing Off symptoms in PD. The APEN was not correlated to none of the other two methods indicating that it measures a different construct of upper limb motor function in PD patients than WAV and SDDV. The APEN also had a better test-retest reliability indicating that it is more stable and consistent over time than WAV and SDDV.