Made available in DSpace on 2014-06-11T19:22:13Z (GMT). No. of bitstreams: 0 Previous issue date: 2011-02-25Bitstream added on 2014-06-13T19:48:22Z : No. of bitstreams: 1 servio_tc_me_botfm.pdf: 1055866 bytes, checksum: d86e7a487aac3e078c759f6ceaf80ca8 (MD5) / Universidade Estadual Paulista (UNESP) / A Doença de refluxo gastroesofágico é uma afecção muito comum. Atualmente, o tratamento cirúrgico videolaparoscópico tem sido amplamente empregado. Porém, apesar de ser uma técnica minimamente invasiva, pode acarretar uma série de alterações pulmonares importantes. Analisar as alterações funcionais respiratórias em indivíduos submetidos à válvula anti-refluxo videolaparoscópica. Foram avaliados, pela equipe do Hospital Estadual Bauru, no período de março de 2009 até maio de 2010, todos os pacientes com indicação cirúrgica. No período pré-operatório todos foram submetidos à anamnese, espirometria, medida do índice diafragmático, ventilometria, manovacuometria, pico de fluxo expiratório, teste de caminhada de 6 minutos e teste de escada. Todos os testes foram repetidos no primeiro, segundo, quinto e trigésimo pós-operatórios. Somente o teste de escada não foi repetido no primeiro pós-operatório. Foi avaliada em cada pós-operatório a escala analógica de dor, e a escala de Borg foi aplicada após os testes dinâmicos. Foram avaliados 32 pacientes, sendo 59% mulheres. A média da idade e do IMC foi de, respectivamente, 44,4±10,9 anos e 28,4±4,8 kg/m2. A amostra foi formada por 75% de não tabagistas, 6% de tabagistas e 19% de ex-tabagistas. Não houve qualquer caso de complicação pós-operatória. O VEF1, CVF, VVM e o PFE apresentaram queda significativa no PO1 e PO2, voltado aos valores pré no PO5. A PImáx e PEmáx apresentaram queda significativa no PO1, mantendo-se no PO2 ainda baixas, mas sem significância estatística com o pré, sendo que no PO5 seus valores já eram superiores aos do PO1 e semelhantes ao pré. O VE teve incremento estatisticamente significativo no PO2, ficando nos outros momentos em valores intermediários entre os valores PRÉ e PO2, enquanto a f teve acréscimo estatisticamente significante no PO1e nos outros momentos... / Gastroesophageal reflux disease is a very common condition. Currently, the laparoscopic surgical treatment has been widely used. However, despite being a minimally invasive technique, it may lead to a series of major pulmonary changes. Evaluate changes in respiratory function in patients who underwent laparoscopic anti-reflux valve. All patients with surgical indications were evaluated by the team of Bauru State Hospital, from March 2009 until May 2010. In the preoperative period all patients underwent history taking, spirometry, measurement of diaphragmatic index, respirometry, manometer, expiratory peak flow, 6-minute walking test and stairclimbing. All the tests were repeated in the first, second, fifth and thirtieth postoperative days. Only the stair climbing test was not repeated in the first postoperative day. It was assessed at each postoperative day the pain analog scale and the Borg scale was applied after the dynamic tests. We evaluated 32 patients, 59% women. The mean age and BMI was respectively 44.4 ± 10.9 years and 28.4 ± 4.8 kg/m2. The sample comprised 75% of nonsmokers, 6% of smokers and 19% of former smokers. There was no case of postoperative complication. FEV1, FVC, MVV and EPF showed significant decrease in PO2 and PO1, and it returned to baseline levels in PO5. The MIP and MEP showed a significant drop in the PO1, PO2 remaining at still low, but without statistical significance with the PRE, while in PO5 their values were already higher than PO1, and similar to the PRE. The MV had statistically significant increase in PO2, presenting at other times intermediate values between PRE and PO2, whereas the f had statistically significant increase in PO1 and presenting at other moments intermediate values to PRE and PO2. The TV and ID did not differ significantly at any time. The distance in 6MWT showed a significant drop in the PO1, and PO2. In PO5 there was no statistical... (Complete abstract click electronic access below)

Orientador: Daniele Cristina Cataneo / Banca: Suzana Erico Tanni / Banca: Karla Luciana Magnani / Resumo: A Doença de refluxo gastroesofágico é uma afecção muito comum. Atualmente, o tratamento cirúrgico videolaparoscópico tem sido amplamente empregado. Porém, apesar de ser uma técnica minimamente invasiva, pode acarretar uma série de alterações pulmonares importantes. Analisar as alterações funcionais respiratórias em indivíduos submetidos à válvula anti-refluxo videolaparoscópica. Foram avaliados, pela equipe do Hospital Estadual Bauru, no período de março de 2009 até maio de 2010, todos os pacientes com indicação cirúrgica. No período pré-operatório todos foram submetidos à anamnese, espirometria, medida do índice diafragmático, ventilometria, manovacuometria, pico de fluxo expiratório, teste de caminhada de 6 minutos e teste de escada. Todos os testes foram repetidos no primeiro, segundo, quinto e trigésimo pós-operatórios. Somente o teste de escada não foi repetido no primeiro pós-operatório. Foi avaliada em cada pós-operatório a escala analógica de dor, e a escala de Borg foi aplicada após os testes dinâmicos. Foram avaliados 32 pacientes, sendo 59% mulheres. A média da idade e do IMC foi de, respectivamente, 44,4±10,9 anos e 28,4±4,8 kg/m2. A amostra foi formada por 75% de não tabagistas, 6% de tabagistas e 19% de ex-tabagistas. Não houve qualquer caso de complicação pós-operatória. O VEF1, CVF, VVM e o PFE apresentaram queda significativa no PO1 e PO2, voltado aos valores pré no PO5. A PImáx e PEmáx apresentaram queda significativa no PO1, mantendo-se no PO2 ainda baixas, mas sem significância estatística com o pré, sendo que no PO5 seus valores já eram superiores aos do PO1 e semelhantes ao pré. O VE teve incremento estatisticamente significativo no PO2, ficando nos outros momentos em valores intermediários entre os valores PRÉ e PO2, enquanto a f teve acréscimo estatisticamente significante no PO1e nos outros momentos... (Resumo completo, clicar acesso eletrônico abaixo) / Abstract: Gastroesophageal reflux disease is a very common condition. Currently, the laparoscopic surgical treatment has been widely used. However, despite being a minimally invasive technique, it may lead to a series of major pulmonary changes. Evaluate changes in respiratory function in patients who underwent laparoscopic anti-reflux valve. All patients with surgical indications were evaluated by the team of Bauru State Hospital, from March 2009 until May 2010. In the preoperative period all patients underwent history taking, spirometry, measurement of diaphragmatic index, respirometry, manometer, expiratory peak flow, 6-minute walking test and stairclimbing. All the tests were repeated in the first, second, fifth and thirtieth postoperative days. Only the stair climbing test was not repeated in the first postoperative day. It was assessed at each postoperative day the pain analog scale and the Borg scale was applied after the dynamic tests. We evaluated 32 patients, 59% women. The mean age and BMI was respectively 44.4 ± 10.9 years and 28.4 ± 4.8 kg/m2. The sample comprised 75% of nonsmokers, 6% of smokers and 19% of former smokers. There was no case of postoperative complication. FEV1, FVC, MVV and EPF showed significant decrease in PO2 and PO1, and it returned to baseline levels in PO5. The MIP and MEP showed a significant drop in the PO1, PO2 remaining at still low, but without statistical significance with the PRE, while in PO5 their values were already higher than PO1, and similar to the PRE. The MV had statistically significant increase in PO2, presenting at other times intermediate values between PRE and PO2, whereas the f had statistically significant increase in PO1 and presenting at other moments intermediate values to PRE and PO2. The TV and ID did not differ significantly at any time. The distance in 6MWT showed a significant drop in the PO1, and PO2. In PO5 there was no statistical... (Complete abstract click electronic access below) / Mestre

The focus of this research is to provide an efficient approach to deal with computationally expensive Multiobjective Optimization Problems (MOP’s). Typically, approximation or surrogate based techniques are adopted to reduce the computational cost. In such cases, the original expensive objective function is replaced by a cheaper mathematical model, where this model mimics the behavior/input-output (i.e. design variable – objective value) relationship. However, it is difficult to model an exact substitute of the targeted objective function. Furthermore, if this kind of approach is used in an evolutionary search, literally, the number of function evaluations does not reduce (i.e. The number of original function evaluation is replaced by the number of surrogate/approximate function evaluation). However, if a large number of individuals are considered, the surrogate model fails to offer smaller computational cost. / To tackle this problem, we have reformulated the concept of surrogate modeling in a different way, which is more suitable for the Multiobjective Evolutionary Algorithm(MOEA) paradigm. In our approach, we do not approximate the objective function; rather we model the input-output behavior of the underlying MOEA itself. The model attempts to identify the search path (in both design-variable and objective spaces) and from this trajectory the model is guaranteed to generate non-dominated solutions (especially, during the initial iterations of the underlying MOEA – with respect to the current solutions) for the next iterations of the MOEA. Therefore, the MOEA can avoid re-evaluating the dominated solutions and thus can save large amount of computational cost due to expensive function evaluations. We have designed our approximation model as a variation operator – that follows the trajectory of the fronts and can be “plugged-in” to any kind of MOEA where non-domination based selection is used. Hence it is termed– the “Pareto-Following Variation Operator (PFVO)”. This approach also provides some added advantage that we can still use the original objective function and thus the search procedure becomes robust and suitable, especially for dynamic problems. / We have integrated the model into three base-line MOEA’s: “Non-dominated Sorting Genetic Algorithm - II (NSGA-II)”, “Strength Pareto Evolutionary Algorithm - II (SPEAII)”and the recently proposed “Regularity Model Based Estimation of Distribution Algorithm (RM-MEDA)”. We have also conducted an exhaustive simulation study using several benchmark MOP’s. Detailed performance and statistical analysis reveals promising results. As an extension, we have implemented our idea for dynamic MOP’s. We have also integrated PFVO into diffusion based/cellular MOEA in a distributed/Grid environment. Most experimental results and analysis reveal that PFVO can be used as a performance enhancement tool for any kind of MOEA.

In this thesis, we generate a lower bound on the security of quantum protocols for secure function evaluation. Central to our proof is the concept of gentle measurements of quantum states, which do not greatly disturb a quantum state if a certain outcome is obtained with high probability. We show how a cheating party can leverage gentle measurements to learn more information than should be allowable. To quantify our lower bound, we reduce a specific cryptographic task known as die-rolling to secure function evaluation and use the concept of gentle measurements to relate their security notions. Our lower bound is then obtained using a known security bound for die-rolling known as Kitaev's bound. Due to the generality of secure function evaluation, we are able to apply this lower bound to obtain lower bounds on the security of quantum protocols for many quantum tasks. In particular, we provide lower bounds for oblivious transfer, XOR oblivious transfer, the equality function, the inner product function, Yao's millionaires' problem, and the secret phrase problem. Note that many of these lower bounds are the first of their kind, which is a testament to the utility of our lower bound. As a consequence, these bounds prove that unconditional security for quantum protocols is impossible for these applications, and since these are constant lower bounds, this rules out any form of boosting toward perfect security. Our work lends itself to future research on designing optimal protocols for the above listed tasks, and potentially others, by providing constant lower bounds to approximate or improve. / Master of Science / Quantifying the cryptographic security of quantum applications is the focus of much research in the quantum cryptography discipline. Quantum protocols might have better security than their classical counterparts, and this advantage might make the adoption of quantum cryptographic protocols a viable option. In this thesis, we introduce a method for generating constant lower bounds on the security of a variety of quantum applications. This is accomplished through finding a lower bound on the security of a protocol that is general, and by virtue of its generality, can be scoped to quantum applications such that the lower bound can be applied, and constant lower bounds generated for these applications. The significance of the work in this thesis is that many of the constant lower bounds presented are the first of their kind for these quantum applications, thus proving the impossibility of them having unconditional security. This also proves that one cannot asymptotically boost towards perfect security in these quantum tasks by any means. These constant lower bounds also provide a foundation for future work in the study of these quantum applications, specifically in the search for upper and lower bounds on their cryptographic security, as well as in the search for protocols that approximate these bounds.

Functional evaluation is one of key arithmetic operations in many applications including 3D graphics and stereo. Among various designs of hardware-based function evaluators, piecewise polynomial approximation methods are the most popular which interpolate the piecewise function curve in a sub-interval using polynomials with polynomial coefficients of each sub-interval stored in an entry of a ROM. The conventional piecewise methods usually determine the bit-widths of each ROM entry and multipliers and adders by analyzing the various error sources, including polynomial approximation errors, coefficient quantization errors, truncation errors of arithmetic operations, and the final rounding error. In this thesis, we present a new piecewise function evaluation design by considering all the error sources together. By combining all the error sources during the approximation, quantization, truncation and rounding, we can efficiently reduce the area cost of ROM and the corresponding arithmetic units. The proposed method is applied to piecewise function evaluators of both uniform and non-uniform segmentation.

Lookup-table (LUT)-based method is a common approach used in all kinds of research topics. In this dissertation, we present several new designs for table-based function evaluation and table-based error correcting coding. In Chapter 3, a new function evaluation method, called two-level approximation, is presented where piecewise degree-one polynomials are used for initial approximation in the first level, followed by the refined approximation for the shared normalized difference functions in the second level. In Chapter 4, we present a new non-uniform segmentation method that searches for the optimal segmentation scheme with the different design goals of minimizing either ROM, total area, or delay. In Chapter 5, a new design methodology for table-based function evaluation is presented. Unlike previous approaches that usually determine the bit widths by assigning allowable errors for individual hardware components, the total error budget of our new design is considered jointly in order to optimized the bit widths of all the hardware components, leading to significant improvements in both area and delay. Finally, in Chapter 6, the similar table-based concept is used in the design of error correcting encoder using the modified polynomial of the Lagrange interpolation formula, resulting in smaller critical path delay and lower power consumption.

Functional evaluation is one of key arithmetic operations in many applications including 3D graphics and stereo. Among various designs of hardware-based function evaluation methods, piecewise polynomial approximation is the most popular approach which interpolates the piecewise function curve in a sub-interval using polynomials with polynomial coefficients of each sub-interval stored in an entry of a lookup table ROM. The conventional piecewise methods usually determine the bit-widths of each ROM entry, multipliers, and adders by analyzing the various error sources, including polynomial approximation errors, coefficient quantization errors, truncation errors of arithmetic operations, and the final rounding error. In this thesis, we present a new piecewise function evaluation design by considering all the error sources together. By combining all the error sources during the approximation, quantization, truncation and rounding, we can efficiently reduce the area cost of ROM and the corresponding arithmetic units in the design of CORDIC processors.

Function evaluation is often used in many science and engineering applications. In order to reduce the computation time, different hardware implementations have been proposed to accelerate the speed of function evaluation. Table-based piecewise polynomial approximation is one of the major methods used in hardware function evaluation designs that require simple hardware components to achieve desired precision. Piecewise polynomial method approximates the original function values in each partitioned subinterval using low-degree polynomials with coefficients stored in look-up tables. Errors are introduced in the hardware implementations. Conventional error analysis in piecewise polynomial methods includes four types of error sources: polynomial approximation error, coefficient quantization error, arithmetic truncation error, and final rounding error. Typical design approach is to pre-allocated maximum allowable error budget for each individual hardware component so that the total error induced from these individual errors satisfies the bit accuracy. In this thesis, we present a new design approach by jointly considering the error sources in designing all the hardware components, including look-up tables and arithmetic units, so that the total area cost is reduced compared to the previously published designs.

We propose a recursive formula for moments of scaling function and sum rule. It is shown that some quadrature formulae has a higher degree of accuracy under proposed moment condition. On this basis we obtain higher accuracy formula for wavelet expansion coefficients which are needed to start the fast wavelet transform and estimate convergence rate of wavelet approximation and sampling of smooth functions. We also present a direct algorithm for solving refinement equation.

No description available.