Software for calculation of reservoir active capacity with the sequent-peak algorithm

It is presented a software developed with Delphi programming language to compute the reservoir's annual regulated active storage, based on the sequent-peak algorithm. Mathematical models used for that purpose generally require extended hydrological series. Usually, the analysis of those series is performed with spreadsheets or graphical representations. Based on that, it was developed a software for calculation of reservoir active capacity. An example calculation is shown by 30-years (from 1977 to 2009) monthly mean flow historical data, from Corrente River, located at São Francisco River Basin, Brazil. As an additional tool, an interface was developed to manage water resources, helping to manipulate data and to point out information that it would be of interest to the user. Moreover, with that interface irrigation districts where water consumption is higher can be analyzed as a function of specific seasonal water demands situations. From a practical application, it is possible to conclude that the program provides the calculation originally proposed. It was designed to keep information organized and retrievable at any time, and to show simulation on seasonal water demands throughout the year, contributing with the elements of study concerning reservoir projects. This program, with its functionality, is an important tool for decision making in the water resources management.

Kahden merkkijonon pisimmän yhteisen alijonon ongelma ja sen ratkaiseminen

Tämä tutkielma kuuluu merkkijonoalgoritmiikan piiriin. Merkkijono S on merkkijonojen X[1..m] ja Y[1..n] yhteinen alijono, mikäli se voidaan muodostaa poistamalla X:stä 0..m ja Y:stä 0..n kappaletta merkkejä mielivaltaisista paikoista. Jos yksikään X:n ja Y:n yhteinen alijono ei ole S:ää pidempi, sanotaan, että S on X:n ja Y:n pisin yhteinen alijono (lyh. PYA). Tässä työssä keskitytään kahden merkkijonon PYAn ratkaisemiseen, mutta ongelma on yleistettävissä myös useammalle jonolle. PYA-ongelmalle on sovelluskohteita – paitsi tietojenkäsittelytieteen niin myös bioinformatiikan osa-alueilla. Tunnetuimpia niistä ovat tekstin ja kuvien tiivistäminen, tiedostojen versionhallinta, hahmontunnistus sekä DNA- ja proteiiniketjujen rakennetta vertaileva tutkimus. Ongelman ratkaisemisen tekee hankalaksi ratkaisualgoritmien riippuvuus syötejonojen useista eri parametreista. Näitä ovat syötejonojen pituuden lisäksi mm. syöttöaakkoston koko, syötteiden merkkijakauma, PYAn suhteellinen osuus lyhyemmän syötejonon pituudesta ja täsmäävien merkkiparien lukumäärä. Täten on vaikeaa kehittää algoritmia, joka toimisi tehokkaasti kaikille ongelman esiintymille. Tutkielman on määrä toimia yhtäältä käsikirjana, jossa esitellään ongelman peruskäsitteiden kuvauksen jälkeen jo aikaisemmin kehitettyjä tarkkoja PYAalgoritmeja. Niiden tarkastelu on ryhmitelty algoritmin toimintamallin mukaan joko rivi, korkeuskäyrä tai diagonaali kerrallaan sekä monisuuntaisesti prosessoiviin. Tarkkojen menetelmien lisäksi esitellään PYAn pituuden ylä- tai alarajan laskevia heuristisia menetelmiä, joiden laskemia tuloksia voidaan hyödyntää joko sellaisinaan tai ohjaamaan tarkan algoritmin suoritusta. Tämä osuus perustuu tutkimusryhmämme julkaisemiin artikkeleihin. Niissä käsitellään ensimmäistä kertaa heuristiikoilla tehostettuja tarkkoja menetelmiä. Toisaalta työ sisältää laajahkon empiirisen tutkimusosuuden, jonka tavoitteena on ollut tehostaa olemassa olevien tarkkojen algoritmien ajoaikaa ja muistinkäyttöä. Kyseiseen tavoitteeseen on pyritty ohjelmointiteknisesti esittelemällä algoritmien toimintamallia hyvin tukevia tietorakenteita ja rajoittamalla algoritmien suorittamaa tuloksetonta laskentaa parantamalla niiden kykyä havainnoida suorituksen aikana saavutettuja välituloksia ja hyödyntää niitä. Tutkielman johtopäätöksinä voidaan yleisesti todeta tarkkojen PYA-algoritmien heuristisen esiprosessoinnin lähes systemaattisesti pienentävän niiden suoritusaikaa ja erityisesti muistintarvetta. Lisäksi algoritmin käyttämällä tietorakenteella on ratkaiseva vaikutus laskennan tehokkuuteen: mitä paikallisempia haku- ja päivitysoperaatiot ovat, sitä tehokkaampaa algoritmin suorittama laskenta on.

Tratamento cirúrgico da doença pilonidal: meta-análise dos principais procedimentos adotados mundialmente

OBJETIVO: Analisar e comparar os diversos procedimentos cirúrgicos descritos para o tratamento da doença pilonidal. MÉTODO: Foram selecionados 34 trabalhos publicados em revistas indexadas, totalizando 8698 doentes operados. Realizou-se meta-análise para comparação das sete principais técnicas cirúrgicas descritas na literatura, quanto aos resultados em relação à recidiva e ao tempo de cicatrização no pós-operatório. RESULTADOS: Do total de doentes estudados, houve recidiva em 230 doentes (2,6%). O tempo de cicatrização no pós-operatório foi significantemente maior no grupo de excisão sem sutura. As recidivas foram estatisticamente semelhantes nos métodos: excisão sem sutura, marsupialização, incisão e curetagem, excisão e retalho e técnica de Karidakys. Os métodos que apresentaram maior índice de recidiva (estatisticamente significante - p<0,001) foram: excisão e sutura primária e o método de Bascom. CONCLUSÕES: Conclui-se, por esse estudo, que os resultados em relação à recidiva são estatisticamente semelhantes em todos os métodos, com exceção da excisão e sutura primária e da técnica de Bascom, que apresentaram recidivas mais freqüentes. O tempo de cicatrização foi maior nos indivíduos operados pela técnica de excisão sem sutura primária.

A lei seca cumpriu sua meta em reduzir acidentes relacionados à ingestão excessiva de álcool?

OBJETIVO: avaliar se a Lei Seca cumpriu sua meta após três anos da promulgação. MÉTODOS: estudo retrospectivo dos pacientes com fraturas craniofaciais submetidos a tratamento cirúrgico em um hospital universitário, em dois períodos: antes (2005 a 2008) e após a implantação da lei (2008 a 2011). RESULTADOS:foram operados 265 pacientes (220 homens e 45 mulheres) nesse período sendo, 149 (56%) antes da lei e 116 (44%) após a lei, indicando redução no número de traumatismos (p=0,04). Houve predomínio da faixa etária entre 19 e 40 anos, em ambos os períodos. As principais causas dos traumas foram os acidentes automobilísticos, as agressões físicas e as quedas. O abuso de álcool foi identificado em 15,4% dos pacientes antes e 19% após a lei. A mandíbula e o complexo maxilozigomático foram os ossos mais acometidos. CONCLUSÃO:a redução no número de politraumatizados operados ficou aquém do esperado e almejado.

Conservative Treatment of Stress Urinary Incontinence: A Systematic Review with Meta-analysis of Randomized Controlled Trials

We performed a systematic review and meta-analysis of randomized controlled trials that studied the conservative management of stress urinary incontinence (SUI). There were 1058 results after the initial searches, from which 37 studies were eligible according to previously determined inclusion criteria. For the primary outcomes, pelvic floor muscle training (PFMT) was more efficacious than no treatment in improving incontinence-specific quality of life (QoL) scales (SMD = [1]1.24SDs; CI 95% = [1]1.77 to [1]0.71SDs). However, its effect on pad tests was imprecise. Combining biofeedback with PFMT had an uncertain effect on QoL (MD = [1]4.4 points; CI 95% = [1]16.69 to 7.89 points), but better results on the pad test, although with elevated heterogeneity (MD = 0.9g; 95%CI = 0.71 to 1,10g); group PFMT was not less efficacious than individual treatment, and home PFMT was not consistently worse than supervised PFMT. Both intravaginal and superficial electrical stimulation (IES and SES) were better than no treatment for QoL and pad test. Vaginal cones had mixed results. The association of IES with PFMT may improve the efficacy of the latter for QoL and pad test, but the results of individual studies were not consistent. Thus, there is evidence of the use of PFMT on the treatment of SUI, with and without biofeedback.

Integration of existing military capability models into the Comprehensive Capability Meta-model

Abstract—This paper discusses existing military capability models and proposes a comprehensive capability meta-model (CCMM) which unites the existing capability models into an integrated and hierarchical whole. The Zachman Framework for Enterprise Architecture is used as a structure for the CCMM. The CCMM takes into account the abstraction level, the primary area of application, stakeholders, intrinsic process, and life cycle considerations of each existing capability model, and shows how the models relate to each other. The validity of the CCMM was verified through a survey of subject matter experts. The results suggest that the CCMM is of practical value to various capability stakeholders in many ways, such as helping to improve communication between the different capability communities.

Algorithm to determine the intersection curves between bezier surfaces by the solution of multivariable polynomial system and the differential marching method

The determination of the intersection curve between Bézier Surfaces may be seen as the composition of two separated problems: determining initial points and tracing the intersection curve from these points. The Bézier Surface is represented by a parametric function (polynomial with two variables) that maps a point in the tridimensional space from the bidimensional parametric space. In this article, it is proposed an algorithm to determine the initial points of the intersection curve of Bézier Surfaces, based on the solution of polynomial systems with the Projected Polyhedral Method, followed by a method for tracing the intersection curves (Marching Method with differential equations). In order to allow the use of the Projected Polyhedral Method, the equations of the system must be represented in terms of the Bernstein basis, and towards this goal it is proposed a robust and reliable algorithm to exactly transform a multivariable polynomial in terms of power basis to a polynomial written in terms of Bernstein basis .

Numerical Simulation of the Cavitation in the Hydrodynamic Lubrication of Journal Bearings: a Parallel Algorithm

In this paper we present an algorithm for the numerical simulation of the cavitation in the hydrodynamic lubrication of journal bearings. Despite the fact that this physical process is usually modelled as a free boundary problem, we adopted the equivalent variational inequality formulation. We propose a two-level iterative algorithm, where the outer iteration is associated to the penalty method, used to transform the variational inequality into a variational equation, and the inner iteration is associated to the conjugate gradient method, used to solve the linear system generated by applying the finite element method to the variational equation. This inner part was implemented using the element by element strategy, which is easily parallelized. We analyse the behavior of two physical parameters and discuss some numerical results. Also, we analyse some results related to the performance of a parallel implementation of the algorithm.

Abbozzo del mappamondo di F. Mauro Camaldolese : cosmografo incomparabile alla metà del sec. XV : esistente nella biblioteca di S. Michele di Murano presso Venezia

Julkaisussa: Il mappamundo di Fra Mauro Camaldolese

Carta particolare della meta inconita con la Gronlandia occidentale è dell' Estotiland scoporto dall' Inglesi : la longitudine comincia da l'isola di Pico d'Asores [i.e. Pico Azores] : di Europa carta LII

Julkaisussa: Dell' arcano del mare di Ruberto Dudleo ... parte seconda del tomo terzo contenente il libro sesto. Vol III

Optimization and Measuring Techniques for Collect-and-Place Machines in Printed Circuit Board Industry

This thesis considers optimization problems arising in printed circuit board assembly. Especially, the case in which the electronic components of a single circuit board are placed using a single placement machine is studied. Although there is a large number of different placement machines, the use of collect-and-place -type gantry machines is discussed because of their flexibility and increasing popularity in the industry. Instead of solving the entire control optimization problem of a collect-andplace machine with a single application, the problem is divided into multiple subproblems because of its hard combinatorial nature. This dividing technique is called hierarchical decomposition. All the subproblems of the one PCB - one machine -context are described, classified and reviewed. The derived subproblems are then either solved with exact methods or new heuristic algorithms are developed and applied. The exact methods include, for example, a greedy algorithm and a solution based on dynamic programming. Some of the proposed heuristics contain constructive parts while others utilize local search or are based on frequency calculations. For the heuristics, it is made sure with comprehensive experimental tests that they are applicable and feasible. A number of quality functions will be proposed for evaluation and applied to the subproblems. In the experimental tests, artificially generated data from Markov-models and data from real-world PCB production are used. The thesis consists of an introduction and of five publications where the developed and used solution methods are described in their full detail. For all the problems stated in this thesis, the methods proposed are efficient enough to be used in the PCB assembly production in practice and are readily applicable in the PCB manufacturing industry.

Chemotherapy versus support cancer treatment in advanced gastric cancer: a meta-analysis

The aim of the present study was to compare the efficacy of chemotherapy and support treatment in patients with advanced non-resectable gastric cancer in a systematic review and meta-analysis of randomized clinical trials that included a comparison of chemotherapy and support care treatment in patients diagnosed with gastric adenocarcinoma, regardless of their age, gender or place of treatment. The search strategy was based on the criteria of the Cochrane Base, using the following key words: 1) randomized clinical trials and antineoplastic combined therapy or gastrointestinal neoplasm, 2) stomach neoplasm and drug therapy, 3) clinical trial and multi-modality therapy, 4) stomach neoplasm and drug therapy or quality of life, 5) double-blind method or clinical trial. The search was carried out using the Cochrane, Medline and Lilacs databases. Five studies fulfilled the inclusion criteria, for a total of 390 participants, 208 (53%) receiving chemotherapy, 182 (47%) receiving support care treatment and 6 losses (1.6%). The 1-year survival rate was 8% for support care and 20% for chemotherapy (RR = 2.14, 95% CI = 1.00-4.57, P = 0.05); 30% of the patients in the chemotherapy group and 12% in the support care group attained a 6-month symptom-free period (RR = 2.33, 95% CI = 1.41-3.87, P < 0.01). Quality of life evaluated after 4 months was significantly better for the chemotherapy patients (34%; RR = 2.07, 95% CI = 1.31-3.28, P < 0.01) with tumor mass reduction (RR = 3.32, 95% CI = 0.77-14.24, P = 0.1). Chemotherapy increased the 1-year survival rate of the patients and provided a longer symptom-free period of 6 months and an improvement in quality of life.