Algorithms for information extraction and signal annotation on long-term biosignals using clustering techniques

Dissertação para obtenção do Grau de Mestre em Engenharia Biomédica

Real-time Task-Splitting scheduling algorithms framework

Nos dias de hoje, os sistemas de tempo real crescem em importância e complexidade. Mediante a passagem do ambiente uniprocessador para multiprocessador, o trabalho realizado no primeiro não é completamente aplicável no segundo, dado que o nível de complexidade difere, principalmente devido à existência de múltiplos processadores no sistema. Cedo percebeu-se, que a complexidade do problema não cresce linearmente com a adição destes. Na verdade, esta complexidade apresenta-se como uma barreira ao avanço científico nesta área que, para já, se mantém desconhecida, e isto testemunha-se, essencialmente no caso de escalonamento de tarefas. A passagem para este novo ambiente, quer se trate de sistemas de tempo real ou não, promete gerar a oportunidade de realizar trabalho que no primeiro caso nunca seria possível, criando assim, novas garantias de desempenho, menos gastos monetários e menores consumos de energia. Este último fator, apresentou-se desde cedo, como, talvez, a maior barreira de desenvolvimento de novos processadores na área uniprocessador, dado que, à medida que novos eram lançados para o mercado, ao mesmo tempo que ofereciam maior performance, foram levando ao conhecimento de um limite de geração de calor que obrigou ao surgimento da área multiprocessador. No futuro, espera-se que o número de processadores num determinado chip venha a aumentar, e como é óbvio, novas técnicas de exploração das suas inerentes vantagens têm de ser desenvolvidas, e a área relacionada com os algoritmos de escalonamento não é exceção. Ao longo dos anos, diferentes categorias de algoritmos multiprocessador para dar resposta a este problema têm vindo a ser desenvolvidos, destacando-se principalmente estes: globais, particionados e semi-particionados. A perspectiva global, supõe a existência de uma fila global que é acessível por todos os processadores disponíveis. Este fato torna disponível a migração de tarefas, isto é, é possível parar a execução de uma tarefa e resumir a sua execução num processador distinto. Num dado instante, num grupo de tarefas, m, as tarefas de maior prioridade são selecionadas para execução. Este tipo promete limites de utilização altos, a custo elevado de preempções/migrações de tarefas. Em contraste, os algoritmos particionados, colocam as tarefas em partições, e estas, são atribuídas a um dos processadores disponíveis, isto é, para cada processador, é atribuída uma partição. Por essa razão, a migração de tarefas não é possível, acabando por fazer com que o limite de utilização não seja tão alto quando comparado com o caso anterior, mas o número de preempções de tarefas decresce significativamente. O esquema semi-particionado, é uma resposta de caráter hibrido entre os casos anteriores, pois existem tarefas que são particionadas, para serem executadas exclusivamente por um grupo de processadores, e outras que são atribuídas a apenas um processador. Com isto, resulta uma solução que é capaz de distribuir o trabalho a ser realizado de uma forma mais eficiente e balanceada. Infelizmente, para todos estes casos, existe uma discrepância entre a teoria e a prática, pois acaba-se por se assumir conceitos que não são aplicáveis na vida real. Para dar resposta a este problema, é necessário implementar estes algoritmos de escalonamento em sistemas operativos reais e averiguar a sua aplicabilidade, para caso isso não aconteça, as alterações necessárias sejam feitas, quer a nível teórico quer a nível prá

Multicore Scheduling of Real-Time Irregular Parallel Algorithms in Linux

Face à estagnação da tecnologia uniprocessador registada na passada década, aos principais fabricantes de microprocessadores encontraram na tecnologia multi-core a resposta `as crescentes necessidades de processamento do mercado. Durante anos, os desenvolvedores de software viram as suas aplicações acompanhar os ganhos de performance conferidos por cada nova geração de processadores sequenciais, mas `a medida que a capacidade de processamento escala em função do número de processadores, a computação sequencial tem de ser decomposta em várias partes concorrentes que possam executar em paralelo, para que possam utilizar as unidades de processamento adicionais e completar mais rapidamente. A programação paralela implica um paradigma completamente distinto da programação sequencial. Ao contrário dos computadores sequenciais tipificados no modelo de Von Neumann, a heterogeneidade de arquiteturas paralelas requer modelos de programação paralela que abstraiam os programadores dos detalhes da arquitectura e simplifiquem o desenvolvimento de aplicações concorrentes. Os modelos de programação paralela mais populares incitam os programadores a identificar instruções concorrentes na sua lógica de programação, e a especificá-las sob a forma de tarefas que possam ser atribuídas a processadores distintos para executarem em simultâneo. Estas tarefas são tipicamente lançadas durante a execução, e atribuídas aos processadores pelo motor de execução subjacente. Como os requisitos de processamento costumam ser variáveis, e não são conhecidos a priori, o mapeamento de tarefas para processadores tem de ser determinado dinamicamente, em resposta a alterações imprevisíveis dos requisitos de execução. `A medida que o volume da computação cresce, torna-se cada vez menos viável garantir as suas restrições temporais em plataformas uniprocessador. Enquanto os sistemas de tempo real se começam a adaptar ao paradigma de computação paralela, há uma crescente aposta em integrar execuções de tempo real com aplicações interativas no mesmo hardware, num mundo em que a tecnologia se torna cada vez mais pequena, leve, ubíqua, e portável. Esta integração requer soluções de escalonamento que simultaneamente garantam os requisitos temporais das tarefas de tempo real e mantenham um nível aceitável de QoS para as restantes execuções. Para tal, torna-se imperativo que as aplicações de tempo real paralelizem, de forma a minimizar os seus tempos de resposta e maximizar a utilização dos recursos de processamento. Isto introduz uma nova dimensão ao problema do escalonamento, que tem de responder de forma correcta a novos requisitos de execução imprevisíveis e rapidamente conjeturar o mapeamento de tarefas que melhor beneficie os critérios de performance do sistema. A técnica de escalonamento baseado em servidores permite reservar uma fração da capacidade de processamento para a execução de tarefas de tempo real, e assegurar que os efeitos de latência na sua execução não afectam as reservas estipuladas para outras execuções. No caso de tarefas escalonadas pelo tempo de execução máximo, ou tarefas com tempos de execução variáveis, torna-se provável que a largura de banda estipulada não seja consumida por completo. Para melhorar a utilização do sistema, os algoritmos de partilha de largura de banda (capacity-sharing) doam a capacidade não utilizada para a execução de outras tarefas, mantendo as garantias de isolamento entre servidores. Com eficiência comprovada em termos de espaço, tempo, e comunicação, o mecanismo de work-stealing tem vindo a ganhar popularidade como metodologia para o escalonamento de tarefas com paralelismo dinâmico e irregular. O algoritmo p-CSWS combina escalonamento baseado em servidores com capacity-sharing e work-stealing para cobrir as necessidades de escalonamento dos sistemas abertos de tempo real. Enquanto o escalonamento em servidores permite partilhar os recursos de processamento sem interferências a nível dos atrasos, uma nova política de work-stealing que opera sobre o mecanismo de capacity-sharing aplica uma exploração de paralelismo que melhora os tempos de resposta das aplicações e melhora a utilização do sistema. Esta tese propõe uma implementação do algoritmo p-CSWS para o Linux. Em concordância com a estrutura modular do escalonador do Linux, ´e definida uma nova classe de escalonamento que visa avaliar a aplicabilidade da heurística p-CSWS em circunstâncias reais. Ultrapassados os obstáculos intrínsecos `a programação da kernel do Linux, os extensos testes experimentais provam que o p-CSWS ´e mais do que um conceito teórico atrativo, e que a exploração heurística de paralelismo proposta pelo algoritmo beneficia os tempos de resposta das aplicações de tempo real, bem como a performance e eficiência da plataforma multiprocessador.

The Effect of Statins on Mortality in Septic Patients: a Meta-Analysis of Randomized Controlled Trials

OBJECTIVE: Statins are among the most prescribed drugs worldwide and their recently discovered anti-inflammatory effect seems to have an important role in inhibiting proinflammatory cytokine production, chemokines expression and counteracting the harmful effects of sepsis on the coagulation system. We decided to perform a meta-analysis of all randomized controlled trials ever published on statin therapy in septic patients to evaluate their effect on survival and length of hospital stay. DATA SOURCES AND STUDY SELECTION: Articles were assessed by four trained investigators, with divergences resolved by consensus. BioMedCentral, PubMed, Embase and the Cochrane Central Register of clinical trials were searched for pertinent studies. Inclusion criteria were random allocation to treatment and comparison of statins versus any comparator in septic patients. DATA EXTRACTION AND SYNTHESIS: Data from 650 patients in 5 randomized controlled studies were analyzed. No difference in mortality between patients receiving statins versus control (44/322 [14%] in the statins group vs 50/328 [15%] in the control arm, RR = 0.90 [95% CI 0.65 to 1.26], p = 0.6) was observed. No differences in hospital stay (p = 0.7) were found. CONCLUSIONS: Published data show that statin therapy has no effect on mortality in the overall population of adult septic patients. Scientific evidence on statins role in septic patients is still limited and larger randomized trials should be performed on this topic.

The impact of national and international observers in democratic elections: A randomized control trial from the Mozambican elections of 2009

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Economics from the NOVA – School of Business and Economics

The effect of Lactobacillus casei and Bifidobacterium breve on antibiotic-associated diarrhea treatment: randomized double-blind clinical trial

INTRODUCTION: Antibiotic-associated diarrhea (AAD) is an important side effect of this specific class of drugs. The objective of this study was to investigate the effect of the use of probiotics in the treatment of AAD. METHODS: A group of hospitalized patients, who contracted diarrhea during or after 7 days of suspension of antimicrobial medication, was blindly randomized to receive a standardized diet associated with the use of the probiotics (Lactobacillus casei and Bifidobacterium breve) or its corresponding placebo, three times a day. RESULTS: Seventy patients were studied. For the experimental (n=35) and control (n=35) groups, respectively, the average time of treatment was 5.06±2.18 and 5.49±3.17 days (p=0.95), and the average duration of diarrhea, among those who were healed, was 4.87±2.13 and 4.52±2.55 days (p=0.36). Four (11.4%) patients who received probiotics and ten (28.6%) who received the placebo were not cured (p=0.13), and relapse rates were similar between both groups. Seven patients from each group, in addition to diarrhea, presented cases of bloating and/or abdominal cramps and/or vomiting (p=1.00). CONCLUSIONS: In this light, it is concluded that L. casei associated with B. breve, in the administered dosage and frequency, has no effect on the antibiotic-associated diarrhea. Similar studies need to be conducted with higher doses of these or other probiotics.

Analysis of classification algorithms for crop detection using LANDSAT 8 images

Remote sensing - the acquisition of information about an object or phenomenon without making physical contact with the object - is applied in a multitude of different areas, ranging from agriculture, forestry, cartography, hydrology, geology, meteorology, aerial traffic control, among many others. Regarding agriculture, an example of application of this information is regarding crop detection, to monitor existing crops easily and help in the region’s strategic planning. In any of these areas, there is always an ongoing search for better methods that allow us to obtain better results. For over forty years, the Landsat program has utilized satellites to collect spectral information from Earth’s surface, creating a historical archive unmatched in quality, detail, coverage, and length. The most recent one was launched on February 11, 2013, having a number of improvements regarding its predecessors. This project aims to compare classification methods in Portugal’s Ribatejo region, specifically regarding crop detection. The state of the art algorithms will be used in this region and their performance will be analyzed.

Bowel preparation for colonoscopy: comparison of mannitol and sodium phosphate. Results of a prospective randomized study

METHOD: Eighty patients were prospectively randomized for precolonoscopic cleansing either with 750 ml of 10% mannitol (Group M) or 180 ml of a sodium phosphate preparation (Group NaP). Laboratory examinations before and after preparation on all patients included hemoglobin, hematocrit, sodium, potassium, phosphorous, calcium and serum osmolarity. A questionnaire was used to assess undesirable side effects and patient tolerance to the solution. The quality of preparation was assessed by the endoscopist who was unaware of the solution employed. RESULTS: Statistically significant changes were verified in serum sodium, phosphorous, potassium and calcium between the two groups, but no clinical symptoms were observed. There were no significant differences in the frequency of side effects studied. Six of the eight patients in Group NaP who had taken mannitol for a previous colonoscopy claimed better acceptance of the sodium phosphate solution. The endoscopic-blinded trial reported excellent or good bowel preparation in 85% prepared with sodium phosphate versus 82.5% for mannitol (p=0.37). CONCLUSIONS: Quality of preparation and frequency of side effects was similar in the two solutions. The smaller volume of sodium phosphate necessary for preparation seems to be related to its favorable acceptance. Nevertheless, the retention of sodium and phosphate ions contraindicates the use of sodium phosphate in patients with renal failure, cirrhosis, ascites, and heart failure.

Conventional approach x laparoscopic abdominoperineal resection for rectal cancer treatment after neoadjuvant chemoradiation: results of a prospective randomized trial

OBJECTIVE: The aims of this study were to evaluate the safety and efficacy of laparoscopic abdominoperineal resection compared to conventional approach for surgical treatment of patients with distal rectal cancer presenting with incomplete response after chemoradiation. METHOD: Twenty eight patients with distal rectal adenocarcinoma were randomized to undergo surgical treatment by laparoscopic abdominoperineal resection or conventional approach and evaluated prospectively. Thirteen underwent laparoscopic abdominoperineal resection and 15 conventional approach. RESULTS: There was no significant difference (p<0,05) between the two studied groups regarding: gender, age, body mass index, patients with previous abdominal surgeries, intra and post operative complications, need for blood transfusion, hospital stay after surgery, length of resected segment and pathological staging. Mean operation time was 228 minutes for the laparoscopic abdominoperineal resection versus 284 minutes for the conventional approach (p=0.04). Mean anesthesia duration was shorter (p=0.03) for laparoscopic abdominoperineal resection when compared to conventional approach : 304 and 362 minutes, respectively. There was no need for conversion to open approach in this series. After a mean follow-up of 47.2 months and with the exclusion of two patients in the conventional abdominoperineal resection who presented with unsuspected synchronic metastasis during surgery, local recurrence was observed in two patients in the conventional group and in none in the laparoscopic group. CONCLUSIONS: We conclude that laparoscopic abdominoperineal resection is feasible, similar to conventional approach concerning surgery duration, intra operative morbidity, blood requirements and post operative morbidity. Larger number of cases and an extended follow-up are required to adequate evaluation of oncological results for patients undergoing laparoscopic abdominoperineal resection after chemoradiation for radical treatment of distal rectal cancer.

Urethral catheter removal 7 or 14 days after radical retropubic prostatectomy: clinical implications and complications in a randomized study

PURPOSE: To evaluate the hypothesis that a 7-day period of indwelling catheter after radical retropubic prostatectomy is effective and safe without the need of performing cystography. METHODS: In the period from January of 2000 to July of 2002, 73 patients underwent radical retropubic prostatectomy, and these patients were prospectively randomized in 2 groups: Group 1-37 patients who had the urethral catheter removed 7 days after the procedure, and Group 2-36 patients who had the catheter removed 14 days after the surgery. The 2 groups were similar, the surgeons and the technique were the same, and no cystography was performed to evaluate the presence of leaks. RESULTS: Two patients in Group 1 had bleeding and clot retention after having the catheter taken out in the seventh postoperative day and were managed by putting the catheter back in for 7 more days. Two patients in Group 2 developed bladder neck stricture and were treated by bladder neck incision with success. The continence rate was the same, with 2 cases of incontinence in each group. About 2 pads a day were used by the patients with incontinence. The average follow-up was 17.5 months (12-36 months). No urinary fistula, urinoma, or pelvic abscesses developed after catheter removal. Two patients were excluded from the analysis of this series: 1 died with a pulmonary embolus in the third postoperative day, and 1 developed a urinary suprapubic fistula before catheter withdrawal, which was maintained for 16 days. CONCLUSION: Withdrawal of the urethral catheter 7 days after radical retropubic prostatectomy, without performing cystography, has a low rate of short-term complications that are equivalent to withdrawal 14 days after the surgery.

Genetic algorithms for the non emergency patients transport service

The authors would like to thank the anonymous reviewers for their valuable comments and suggestions to improve the paper. The authors would like to thank Dr. Elaine DeBock for reviewing the manuscript.

Comparison of single and multi-objective evolutionary algorithms for robust link-state routing

Traffic Engineering (TE) approaches are increasingly impor- tant in network management to allow an optimized configuration and resource allocation. In link-state routing, the task of setting appropriate weights to the links is both an important and a challenging optimization task. A number of different approaches has been put forward towards this aim, including the successful use of Evolutionary Algorithms (EAs). In this context, this work addresses the evaluation of three distinct EAs, a single and two multi-objective EAs, in two tasks related to weight setting optimization towards optimal intra-domain routing, knowing the network topology and aggregated traffic demands and seeking to mini- mize network congestion. In both tasks, the optimization considers sce- narios where there is a dynamic alteration in the state of the system, in the first considering changes in the traffic demand matrices and in the latter considering the possibility of link failures. The methods will, thus, need to simultaneously optimize for both conditions, the normal and the altered one, following a preventive TE approach towards robust configurations. Since this can be formulated as a bi-objective function, the use of multi-objective EAs, such as SPEA2 and NSGA-II, came nat- urally, being those compared to a single-objective EA. The results show a remarkable behavior of NSGA-II in all proposed tasks scaling well for harder instances, and thus presenting itself as the most promising option for TE in these scenarios.

An immunity based configuration for multilayer single featured biometric authentication algorithms

Immune systems have been used in the last years to inspire approaches for several computational problems. This paper focus on behavioural biometric authentication algorithms’ accuracy enhancement by using them more than once and with different thresholds in order to first simulate the protection provided by the skin and then look for known outside entities, like lymphocytes do. The paper describes the principles that support the application of this approach to Keystroke Dynamics, an authentication biometric technology that decides on the legitimacy of a user based on his typing pattern captured on he enters the username and/or the password and, as a proof of concept, the accuracy levels of one keystroke dynamics algorithm when applied to five legitimate users of a system both in the traditional and in the immune inspired approaches are calculated and the obtained results are compared.

Algorithms and tools for in silico design of cell factories

PhD thesis in Bioengineering

Biomass equations for forest regrowth in the eastern Amazon using randomized branch sampling

Forest regrowth occupies an extensive and increasing area in the Amazon basin, but accurate assessment of the impact of regrowth on carbon and nutrient cycles has been hampered by a paucity of available allometric equations. We develop pooled and species-specific equations for total aboveground biomass for a study site in the eastern Amazon that had been abandoned for 15 years. Field work was conducted using randomized branch sampling, a rapid technique that has seen little use in tropical forests. High consistency of sample paths in randomized branch sampling, as measured by the standard error of individual paths (14%), suggests the method may provide substantial efficiencies when compared to traditional procedures. The best fitting equations in this study used the traditional form Y=a×DBHb, where Y is biomass, DBH is diameter at breast height, and a and b are both species-specific parameters. Species-specific equations of the form Y=a(BA×H), where Y is biomass, BA is tree basal area, H is tree height, and a is a species-specific parameter, fit almost as well. Comparison with previously published equations indicated errors from -33% to +29% would have occurred using off-site relationships. We also present equations for stemwood, twigs, and foliage as biomass components.