Positive solutions of fourth order problems with clamped beam boundary conditions

n this paper we make an exhaustive study of the fourth order linear operator u((4)) + M u coupled with the clamped beam conditions u(0) = u(1) = u'(0) = u'(1) = 0. We obtain the exact values on the real parameter M for which this operator satisfies an anti-maximum principle. Such a property is equivalent to the fact that the related Green's function is nonnegative in [0, 1] x [0, 1]. When M < 0 we obtain the best estimate by means of the spectral theory and for M > 0 we attain the optimal value by studying the oscillation properties of the solutions of the homogeneous equation u((4)) + M u = 0. By using the method of lower and upper solutions we deduce the existence of solutions for nonlinear problems coupled with this boundary conditions. (C) 2011 Elsevier Ltd. All rights reserved.

A checkpointing-enabled and resource-aware Java Virtual Machine for efficient and robust e-Science applications in grid environments

Object-oriented programming languages presently are the dominant paradigm of application development (e. g., Java,. NET). Lately, increasingly more Java applications have long (or very long) execution times and manipulate large amounts of data/information, gaining relevance in fields related with e-Science (with Grid and Cloud computing). Significant examples include Chemistry, Computational Biology and Bio-informatics, with many available Java-based APIs (e. g., Neobio). Often, when the execution of such an application is terminated abruptly because of a failure (regardless of the cause being a hardware of software fault, lack of available resources, etc.), all of its work already performed is simply lost, and when the application is later re-initiated, it has to restart all its work from scratch, wasting resources and time, while also being prone to another failure and may delay its completion with no deadline guarantees. Our proposed solution to address these issues is through incorporating mechanisms for checkpointing and migration in a JVM. These make applications more robust and flexible by being able to move to other nodes, without any intervention from the programmer. This article provides a solution to Java applications with long execution times, by extending a JVM (Jikes research virtual machine) with such mechanisms. Copyright (C) 2011 John Wiley & Sons, Ltd.

Knee muscle strength, balance and functional independence in persons with stroke

Purpose: to investigate the relationship between knee muscle strength, balance and functional independence within the first month after stroke. Relevance: cerebral vascular disease is one of the main causes of morbidity, disability and mortality in developed countries. Problems with movement control are frequent after stroke. Lower limb weakness and impaired balance are common problems that are related with the risk of falls and are likely to interfere with the ability to perform daily life activities. Physiotherapy intervention usually starts early after stroke and addresses impairments related to movement and posture in order to improve motor recovery and restore function.

Muscle strength, balance and functional independence in persons with stroke

Cerebral vascular disease is one of the main causes of morbidity, disability and mortality in developed countries. Problems with movement control are frequent after stroke. Lower limb weakness and impaired balance are common problems that are related with the risk of falls and are likely to interfere with the ability to perform daily life activities. Physiotherapy intervention usually starts early after stroke and addresses impairments related to movement and posture in order to improve motor recovery and restore function. Purpose: to investigate the relationship between knee muscle strength, balance and functional independence within the first month after stroke.

Study on influence of the new CoDeSys V3.0 on the existing CoDeSys discipline of the Mind8 Engineering Center

CoDeSys "Controller Development Systems" is a development environment for programming in the area of automation controllers. It is an open source solution completely in line with the international industrial standard IEC 61131-3. All five programming languages for application programming as defined in IEC 61131-3 are available in the development environment. These features give professionals greater flexibility with regard to programming and allow control engineers have the ability to program for many different applications in the languages in which they feel most comfortable. Over 200 manufacturers of devices from different industrial sectors offer intelligent automation devices with a CoDeSys programming interface. In 2006, version 3 was released with new updates and tools. One of the great innovations of the new version of CoDeSys is object oriented programming. Object oriented programming (OOP) offers great advantages to the user for example when wanting to reuse existing parts of the application or when working on one application with several developers. For this reuse can be prepared a source code with several well known parts and this is automatically generated where necessary in a project, users can improve then the time/cost/quality management. Until now in version 2 it was necessary to have hardware interface called “Eni-Server” to have access to the generated XML code. Another of the novelties of the new version is a tool called Export PLCopenXML. This tool makes it possible to export the open XML code without the need of specific hardware. This type of code has own requisites to be able to comply with the standard described above. With XML code and with the knowledge how it works it is possible to do component-oriented development of machines with modular programming in an easy way. Eplan Engineering Center (EEC) is a software tool developed by Mind8 GmbH & Co. KG that allows configuring and generating automation projects. Therefore it uses modules of PLC code. The EEC already has a library to generate code for CoDeSys version 2. For version 3 and the constant innovation of drivers by manufacturers, it is necessary to implement a new library in this software. Therefore it is important to study the XML export to be then able to design any type of machine. The purpose of this master thesis is to study the new version of the CoDeSys XML taking into account all aspects and impact on the existing CoDeSys V2 models and libraries in the company Harro Höfliger Verpackungsmaschinen GmbH. For achieve this goal a small sample named “Traffic light” in CoDeSys version 2 will be done and then, using the tools of the new version it there will be a project with version 3 and also the EEC implementation for the automatically generated code.

Modelos de simulação em MATSim aplicados à análise de sistemas de transporte

Dissertação para obtenção do grau de Mestre em Engenharia Civil na Área de Especialização de Vias de Comunicação e Transportes

Efeitos de um programa baseado em tarefas orientadas na competência de marcha em indivíduos com acidente vascular cerebral

Mestrado em Fisioterapia.

Modelo SIG para apoio à análise de sistemas de transportes e usos do solo

Dissertação de natureza científica para obtenção do grau de Mestre em Engenharia Civil

A divisão no 4º ano de escolaridade

Dissertação apresentada para obtenção do grau de Mestre em Educação Matemática na Educação Pré-Escolar e nos 1.º e 2.º Ciclos do Ensino Básico

Estudo dos sistema de automação da protecção diferencial de linha e comparação direccional

O tema do sistema de automação da protecção diferencial de linha e comparação direccional é merecedor de uma nova abordagem devido às recentes inovações tecnológicas ocorridas desde o aparecimento dos relés digitais e à consequente comunicação entre os sistemas de protecção, em particular na comunicação entre protecções diferenciais de linha. A protecção diferencial de linha apresenta claras vantagens face às protecções actualmente utilizadas para a protecção de linhas de transmissão e distribuição, tais como, Protecção de Máximo Intensidade de Fase, Máximo Intensidade Homopolar Direccionale Protecção de Distância. Contudo, existem alguns problemas associados a este tipo de protecções, nomeadamente na comunicação entre relés. Para automação e comunicação de protecções diferenciais de linhas de transmissão, no caso da ocorrência de defeitos na zona protegida pelo sistema de protecção diferencial foi empregue um método inovador para este tipo de sistema. Uma vez que a eficácia da actuação das protecções diferenciais depende do rigor das variáveis que são necessárias enviar entre protecções que se encontram localizadas em subestações distintas, recorreu-se à utilização de um automatismo para comunicação entre relés suportado pelo desenvolvimento de novos algoritmos para detectar quase instantaneamente um defeito em qualquer zona de protecção de uma linha de transmissão. Estes algoritmos são baseados na Transformada de Park, pelo que, é introduzido um novo conceito neste tipo de protecções. Através destes algoritmos é possível atenuar os problemas associados à protecção diferencial de linha. No sentido de verificar a aplicabilidade destes algoritmos à protecção diferencial de linha são apresentados diversos casos de estudo. Através dos resultados obtidos também foi possível verificar as vantagens associadas à utilização dos algoritmos propostos.

Water quality in lakes and reservoirs in China

Dissertation elaborated for the partial fulfilment of the requirements of the Master Degree in Civil Engineering in the Speciality Area of Hydarulics

Incremental filter and wrapper approaches for feature discretization

Discrete data representations are necessary, or at least convenient, in many machine learning problems. While feature selection (FS) techniques aim at finding relevant subsets of features, the goal of feature discretization (FD) is to find concise (quantized) data representations, adequate for the learning task at hand. In this paper, we propose two incremental methods for FD. The first method belongs to the filter family, in which the quality of the discretization is assessed by a (supervised or unsupervised) relevance criterion. The second method is a wrapper, where discretized features are assessed using a classifier. Both methods can be coupled with any static (unsupervised or supervised) discretization procedure and can be used to perform FS as pre-processing or post-processing stages. The proposed methods attain efficient representations suitable for binary and multi-class problems with different types of data, being competitive with existing methods. Moreover, using well-known FS methods with the features discretized by our techniques leads to better accuracy than with the features discretized by other methods or with the original features. (C) 2013 Elsevier B.V. All rights reserved.

The extended unsymmetric frontal solution for multiple-point constraints

The purpose of this paper is to discuss the linear solution of equality constrained problems by using the Frontal solution method without explicit assembling. Design/methodology/approach - Re-written frontal solution method with a priori pivot and front sequence. OpenMP parallelization, nearly linear (in elimination and substitution) up to 40 threads. Constraints enforced at the local assembling stage. Findings - When compared with both standard sparse solvers and classical frontal implementations, memory requirements and code size are significantly reduced. Research limitations/implications - Large, non-linear problems with constraints typically make use of the Newton method with Lagrange multipliers. In the context of the solution of problems with large number of constraints, the matrix transformation methods (MTM) are often more cost-effective. The paper presents a complete solution, with topological ordering, for this problem. Practical implications - A complete software package in Fortran 2003 is described. Examples of clique-based problems are shown with large systems solved in core. Social implications - More realistic non-linear problems can be solved with this Frontal code at the core of the Newton method. Originality/value - Use of topological ordering of constraints. A-priori pivot and front sequences. No need for symbolic assembling. Constraints treated at the core of the Frontal solver. Use of OpenMP in the main Frontal loop, now quantified. Availability of Software.

Graffiti nas edificações: identificação e resolução do problema

Trabalho final de Mestrado para obtenção do grau de Mestre em Engenharia Civil na Área de Especialização em Edificações

Determinação dos valores de referência da excursão sistólica do plano do anel tricúspide (TAPSE) em crianças saudáveis

Mestrado em Tecnologia de Diagnóstico e Intervenção Cardiovascular - Área de especialização: Ultrassonografia cardiovascular