994 resultados para Java,
Resumo:
Dissertao para obteno do grau de Mestre em Engenharia Civil na rea de Especializao de Vias de Comunicao e Transportes
Resumo:
Actualmente, os sistemas embebidos esto presentes em toda a parte. Embora grande parte da populao que os utiliza no tenha a noo da sua presena, na realidade, se repentinamente estes sistemas deixassem de existir, a sociedade iria sentir a sua falta. A sua utilizao massiva deve-se ao facto de estarem practicamente incorporados em quase os todos dispositivos electrnicos de consumo, telecomunicaes, automao industrial e automvel. Influenciada por este crescimento, a comunidade cientfica foi confrontada com novos problemas distribudos por vrios domnios cientficos, dos quais so destacados a gesto da qualidade de servio e gesto de recursos - domnio encarregue de resolver problemas relacionados com a alocao ptima de recursos fsicos, tais como rede, memria e CPU. Existe na literatura um vasto conjunto de modelos que propem solues para vrios problemas apresentados no contexto destes domnios cientficos. No entanto, no possvel encontrar modelos que lidem com a gesto de recursos em ambientes de execuo cooperativos e abertos com restries temporais utilizando coligaes entre diferentes ns, de forma a satisfazer os requisitos no funcionais das aplicaes. Devido ao facto de estes sistemas serem dinmicos por natureza, apresentam a caracterstica de no ser possvel conhecer, a priori, a quantidade de recursos necessrios que uma aplicao ir requerer do sistema no qual ir ser executada. Este conhecimento s adquirido aquando da execuo da aplicao. De modo a garantir uma gesto eficiente dos recursos disponveis, em sistemas que apresentam um grande dinamismo na execuo de tarefas com e sem restries temporais, necessrio garantir dois aspectos fundamentais. O primeiro est relacionado com a obteno de garantias na execuo de tarefas de tempo-real. Estas devem sempre ser executadas dentro da janela temporal requirida. O segundo aspecto refere a necessidade de garantir que todos os recursos necessrios execuo das tarefas so fornecidos, com o objectivo de manter os nveis de performance quer das aplicaes, quer do prprio sistema. Tendo em conta os dois aspectos acima mencionados, o projecto CooperatES foi especificado com o objectivo de permitir a dispositivos com poucos recursos uma execuo colectiva de servios com os seus vizinhos, de modo a cumprir com as complexas restries de qualidade de servio impostas pelos utilizadores ou pelas aplicaes. Decorrendo no contexto do projecto CooperatES, o trabalho resultante desta tese tem como principal objectivo avaliar a practicabilidade dos conceitos principais propostos no mbito do projecto. O trabalho em causa implicou a escolha e anlise de uma plataforma, a anlise de requisitos, a implementao e avaliao de uma framework que permite a execuo cooperativa de aplicaes e servios que apresentem requisitos de qualidade de servio. Do trabalho desenvolvido resultaram as seguintes contribuies: Anlise das plataformas de cdigo aberto que possam ser utilizadas na implementao dos conceitos relacionados com o projecto CooperatES; Critrios que influenciaram a escolha da plataforma Android e um estudo focado na anlise da plataforma sob uma perspectiva de sistemas de tempo-real; Experincias na implementao dos conceitos do projecto na plataforma Android; Avaliao da practicabilidade dos conceitos propostos no projecto CooperatES; Proposta de extenses que permitam incorporar caractersticas de sistemas de tempo real abertos na plataforma Android.
Resumo:
Grande parte dos triples-stores so open source e desenvolvidos em Java, disponibilizando interfaces standards e privadas de acesso. A grande maioria destes sistemas no dispe de mecanismos de controlo de acessos nativos, o que dificulta ou impossibilita a sua adopo em ambientes em que a segurana dos factos importante (e.g. ambiente empresarial). Complementarmente observa-se que o modelo de controlo de acesso a triplos e em particular a triplos descritos por ontologias no est standardizado nem sequer estabilizado, havendo diversos modelos de descrio e algoritmos de avaliao de permisses de acesso. O trabalho desenvolvido nesta tese/dissertao prope um modelo e interface de controlo de acesso que permite e facilite a sua adopo por diferentes triple-stores j existentes e a integrao dos triples-stores com outros sistemas j existentes na organizao. Complementarmente, a plataforma de controlo de acesso no impe qualquer modelo ou algoritmo de avaliao de permisses, mas pelo contrrio permite a adopo de modelos e algoritmos distintos em funo das necessidades ou desejos. Finalmente demonstra-se a aplicabilidade e validade do modelo e interface propostos, atravs da sua implementao e adopo ao triple-store SwiftOWLIM j existente, que no dispe de mecanismo de controlo de acessos nativo.
Resumo:
O contributo da rea de investigao Interaco Humano-Computador (HCI) est patente no s na qualidade da interaco, mas tambm na diversificao das formas de interaco. A HCI define-se como sendo uma disciplina que se dedica ao desenho, desenvolvimento e implementao de sistemas de computao interactivos para uso humano e estudo dos fenmenos relevantes que os rodeiam. Pretende-se, no mbito desta tese de mestrado, o desenvolvimento de um Editor Grfico de Layout Fabril a integrar num SAD para suporte ao Planeamento e Controlo da Produo. O sistema deve ser capaz de gerar um layout fabril do qual constam, entre outros objectos, as representaes grficas e as respectivas caractersticas/atributos do conjunto de recursos (mquinas/processadores) existentes no sistema de produo a modelar. O mdulo desenvolvido ser integrado no projecto de I&D ADSyS (Adaptative Decision Support System for Interactive Scheduling with MetaCognition and User Modeling Experience), melhorando aspectos de interaco referentes ao sistema AutoDynAgents, um dedicado ao escalonamento, planeamento e controlo de produo. Foi realizada a anlise de usabilidade a este mdulo com a qual se pretendeu realizar a respectiva avaliao, atravs da realizao de um teste de eficincia e do preenchimento de um inqurito, da qual se identificaram um conjunto de melhorias e sugestes a serem consideradas no refinamento deste mdulo.
Resumo:
Ada is really an unfortunate Lady. After years fighting against C/C++ villains, her major lift-up (Ada 95) had brought up a promise of fortune. However, a new strong villain (Java) has appeared trying to end her struggle for survival. Ada has now to fight with her own weapons. She will only prosper by her own merits. But two questions emerge. Do they exist? Are they better than Javas? Our opinion is that they do exist, and are not matched by any other programming language
Resumo:
This paper discusses the increased need to support dynamic task-level parallelism in embedded real-time systems and proposes a Java framework that combines the Real-Time Specification for Java (RTSJ) with the Fork/Join (FJ) model, following a fixed priority-based scheduling scheme. Our work intends to support parallel runtimes that will coexist with a wide range of other complex independently developed applications, without any previous knowledge about their real execution requirements, number of parallel sub-tasks, and when those sub-tasks will be generated.
Resumo:
As the complexity of embedded systems increases, multiple services have to compete for the limited resources of a single device. This situation is particularly critical for small embedded devices used in consumer electronics, telecommunication, industrial automation, or automotive systems. In fact, in order to satisfy a set of constraints related to weight, space, and energy consumption, these systems are typically built using microprocessors with lower processing power and limited resources. The CooperatES framework has recently been proposed to tackle these challenges, allowing resource constrained devices to collectively execute services with their neighbours in order to fulfil the complex Quality of Service (QoS) constraints imposed by users and applications. In order to demonstrate the framework's concepts, a prototype is being implemented in the Android platform. This paper discusses key challenges that must be addressed and possible directions to incorporate the desired real-time behaviour in Android.
Resumo:
Workflows have been successfully applied to express the decomposition of complex scientific applications. This has motivated many initiatives that have been developing scientific workflow tools. However the existing tools still lack adequate support to important aspects namely, decoupling the enactment engine from workflow tasks specification, decentralizing the control of workflow activities, and allowing their tasks to run autonomous in distributed infrastructures, for instance on Clouds. Furthermore many workflow tools only support the execution of Direct Acyclic Graphs (DAG) without the concept of iterations, where activities are executed millions of iterations during long periods of time and supporting dynamic workflow reconfigurations after certain iteration. We present the AWARD (Autonomic Workflow Activities Reconfigurable and Dynamic) model of computation, based on the Process Networks model, where the workflow activities (AWA) are autonomic processes with independent control that can run in parallel on distributed infrastructures, e. g. on Clouds. Each AWA executes a Task developed as a Java class that implements a generic interface allowing end-users to code their applications without concerns for low-level details. The data-driven coordination of AWA interactions is based on a shared tuple space that also enables support to dynamic workflow reconfiguration and monitoring of the execution of workflows. We describe how AWARD supports dynamic reconfiguration and discuss typical workflow reconfiguration scenarios. For evaluation we describe experimental results of AWARD workflow executions in several application scenarios, mapped to a small dedicated cluster and the Amazon (Elastic Computing EC2) Cloud.
Resumo:
Obteno do grau de Mestre em Engenharia Electrotcnica, Sistemas e Computadores
Resumo:
Penalty and Barrier methods are normally used to solve Nonlinear Optimization Problems constrained problems. The problems appear in areas such as engineering and are often characterised by the fact that involved functions (objective and constraints) are non-smooth and/or their derivatives are not know. This means that optimization methods based on derivatives cannot net used. A Java based API was implemented, including only derivative-free optimizationmethods, to solve both constrained and unconstrained problems, which includes Penalty and Barriers methods. In this work a new penalty function, based on Fuzzy Logic, is presented. This function imposes a progressive penalization to solutions that violate the constraints. This means that the function imposes a low penalization when the violation of the constraints is low and a heavy penalisation when the violation is high. The value of the penalization is not known in beforehand, it is the outcome of a fuzzy inference engine. Numerical results comparing the proposed function with two of the classic penalty/barrier functions are presented. Regarding the presented results one can conclude that the prosed penalty function besides being very robust also exhibits a very good performance.
Resumo:
Search Optimization methods are needed to solve optimization problems where the objective function and/or constraints functions might be non differentiable, non convex or might not be possible to determine its analytical expressions either due to its complexity or its cost (monetary, computational, time,...). Many optimization problems in engineering and other fields have these characteristics, because functions values can result from experimental or simulation processes, can be modelled by functions with complex expressions or by noise functions and it is impossible or very difficult to calculate their derivatives. Direct Search Optimization methods only use function values and do not need any derivatives or approximations of them. In this work we present a Java API that including several methods and algorithms, that do not use derivatives, to solve constrained and unconstrained optimization problems. Traditional API access, by installing it on the developer and/or user computer, and remote API access to it, using Web Services, are also presented. Remote access to the API has the advantage of always allow the access to the latest version of the API. For users that simply want to have a tool to solve Nonlinear Optimization Problems and do not want to integrate these methods in applications, also two applications were developed. One is a standalone Java application and the other a Web-based application, both using the developed API.
Resumo:
Constrained and unconstrained Nonlinear Optimization Problems often appear in many engineering areas. In some of these cases it is not possible to use derivative based optimization methods because the objective function is not known or it is too complex or the objective function is non-smooth. In these cases derivative based methods cannot be used and Direct Search Methods might be the most suitable optimization methods. An Application Programming Interface (API) including some of these methods was implemented using Java Technology. This API can be accessed either by applications running in the same computer where it is installed or, it can be remotely accessed through a LAN or the Internet, using webservices. From the engineering point of view, the information needed from the API is the solution for the provided problem. On the other hand, from the optimization methods researchers point of view, not only the solution for the problem is needed. Also additional information about the iterative process is useful, such as: the number of iterations; the value of the solution at each iteration; the stopping criteria, etc. In this paper are presented the features added to the API to allow users to access to the iterative process data.
Resumo:
Nonlinear Optimization Problems are usual in many engineering fields. Due to its characteristics the objective function of some problems might not be differentiable or its derivatives have complex expressions. There are even cases where an analytical expression of the objective function might not be possible to determine either due to its complexity or its cost (monetary, computational, time, ...). In these cases Nonlinear Optimization methods must be used. An API, including several methods and algorithms to solve constrained and unconstrained optimization problems was implemented. This API can be accessed not only as traditionally, by installing it on the developer and/or user computer, but it can also be accessed remotely using Web Services. As long as there is a network connection to the server where the API is installed, applications always access to the latest API version. Also an Web-based application, using the proposed API, was developed. This application is to be used by users that do not want to integrate methods in applications, and simply want to have a tool to solve Nonlinear Optimization Problems.
Resumo:
In this paper a new simulation environment for a virtual laboratory to educational proposes is presented. The Logisim platform was adopted as the base digital simulation tool, since it has a modular implementation in Java. All the hardware devices used in the laboratory course was designed as components accessible by the simulation tool, and integrated as a library. Moreover, this new library allows the user to access an external interface. This work was motivated by the needed to achieve better learning times on co-design projects, based on hardware and software implementations, and to reduce the laboratory time, decreasing the operational costs of engineer teaching. Furthermore, the use of virtual laboratories in educational environments allows the students to perform functional tests, before they went to a real laboratory. Moreover, these functional tests allow to speed-up the learning when a problem based approach methodology is considered. 2014 IEEE.
Resumo:
Dissertao apresentada na Faculdade de Cincias e Tecnologia da Universidade Nova de Lisboa para obteno do grau de Mestre em Engenharia Informtica