Avalição de reusabilidade de aplicações web baseadas em frameworks orientados a ações e a componentes: estudo de Caso sobre os Frameworks Apache Struts e JavaServer Faces

Over the years the use of application frameworks designed for the View and Controller layers of MVC architectural pattern adapted to web applications has become very popular. These frameworks are classified into Actions Oriented and Components Oriented , according to the solution strategy adopted by the tools. The choice of such strategy leads the system architecture design to acquire non-functional characteristics caused by the way the framework influences the developer to implement the system. The components reusability is one of those characteristics and plays a very important role for development activities such as system evolution and maintenance. The work of this dissertation consists to analyze of how the reusability could be influenced by the Web frameworks usage. To accomplish this, small academic management applications were developed using the latest versions of Apache Struts and JavaServer Faces frameworks, the main representatives of Java plataform Web frameworks of. For this assessment was used a software quality model that associates internal attributes, which can be measured objectively, to the characteristics in question. These attributes and metrics defined for the model were based on some work related discussed in the document

Um framework de agentes de recomendação para sistemas Web

The World Wide Web has been consolidated over the last years as a standard platform to provide software systems in the Internet. Nowadays, a great variety of user applications are available on the Web, varying from corporate applications to the banking domain, or from electronic commerce to the governmental domain. Given the quantity of information available and the quantity of users dealing with their services, many Web systems have sought to present recommendations of use as part of their functionalities, in order to let the users to have a better usage of the services available, based on their profile, history navigation and system use. In this context, this dissertation proposes the development of an agent-based framework that offers recommendations for users of Web systems. It involves the conception, design and implementation of an object-oriented framework. The framework agents can be plugged or unplugged in a non-invasive way in existing Web applications using aspect-oriented techniques. The framework is evaluated through its instantiation to three different Web systems

Determination of the optimal quantity of crop residues for energy in sugarcane crop management using linear programming in variety selection and planting strategy

The aim of this work was to present organizational models for optimizing the reduction of crop residue generated by the sugarcane culture. The first model consisted of the selection of varieties of sugarcane to be planted meeting the mill requirements and, at the same time, to minimize the quantity of residue produced. The second model discussed the use of residue to produce energy. This is related to the selection of variety and quantity to be planted, in order to meet the requirements of the mill, to reduce the quantity of residue, and to maximize as much as possible the energy production. The use of linear programming was proposed. The two models presented similar results in this study, and both may be used to define the varieties and areas to be cultivated. (C) 2001 Published by Elsevier B.V. Ltd.

Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Heterogeneity correction in the construction of optimized planning in radiotherapy using linear programming

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Optimization Strategies Based on Sequential Quadratic Programming Applied for a Fermentation Process for Butanol Production

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Strain Gauge Analysis of the Effect of Porcelain Firing Simulation on the Prosthetic Misfit of Implant-Supported Frameworks

Objectives: This study investigated the effect of porcelain firing on the misfit of implant-supported frameworks and analyzed the influence of preheat treatment on the dimensional alterations.Materials and Methods: Four external-hex cylindrical implants were placed in polyurethane block. Ten frameworks of screw-retained implant-supported prostheses were cast in Pd-Ag using 2 procedures: (1) control group (CG, n = 5): cast in segments and laser welded; and test group (TG, n = 5): cast in segments, preheated, and laser welded. All samples were subjected to firing to simulate porcelain veneering firing. Strain gauges were bonded around the implants, and microstrain values (mu epsilon = 10(-6)epsilon) were recorded after welding (M1), oxidation cycle (M2), and glaze firing (M3). Data were statistically analyzed (2-way analysis of variance, Bonferroni, alpha = 0.05).Results: The microstrain value in the CG at M3 (475.2 mu epsilon) was significantly different from the values observed at M1 (355.6 mu epsilon) and M2 (413.9 mu epsilon). The values at M2 and M3 in the CG were not statistically different. Microstrain values recorded at different moments (M1: 361.6 mu epsilon/M2: 335.3 mu epsilon/M3: 307.2 mu epsilon) did not show significant difference.Conclusions: The framework misfit deteriorates during firing cycles of porcelain veneering. Metal distortion after porcelain veneering could be controlled by preheat treatment. (Implant Dent 2012;21:225-229)

Up-conversion properties of lanthanide-organic frameworks and how to track ammunitions using these materials

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Design and management optimization of trickle irrigation systems using non-linear programming

A non-linear model is presented which optimizes the lay-out, as well as the design and management of trickle irrigation systems, to achieve maximum net benefit. The model consists of an objective function that maximizes profit at the farm level, subject to appropriate geometric and hydraulic constraints. It can be applied to rectangular shaped fields, with uniform or zero slope. The software used is the Gams-Minos package. The basic inputs are the crop-water-production function, the cost function and cost of system components, and design variables. The main outputs are the annual net benefit and pipe diameters and lengths. To illustrate the capability of the model, a sensitivity analysis of the annual net benefit for a citrus field is evaluated with respect to irrigated area, ground slope, micro-sprinkler discharge and shape of the field. The sensitivity analysis suggests that the greatest benefit is obtained with the smallest microsprinkler discharge, the greatest area, a square field and zero ground slope. The costs of the investment and energy are the components of the objective function that had the greatest effect in the 120 situations evaluated. (C) 1996 Academic Press Limited

Efficient linear programming algorithm for the transmission network expansion planning problem

The transmission network planning problem is a non-linear integer mixed programming problem (NLIMP). Most of the algorithms used to solve this problem use a linear programming subroutine (LP) to solve LP problems resulting from planning algorithms. Sometimes the resolution of these LPs represents a major computational effort. The particularity of these LPs in the optimal solution is that only some inequality constraints are binding. This task transforms the LP into an equivalent problem with only one equality constraint (the power flow equation) and many inequality constraints, and uses a dual simplex algorithm and a relaxation strategy to solve the LPs. The optimisation process is started with only one equality constraint and, in each step, the most unfeasible constraint is added. The logic used is similar to a proposal for electric systems operation planning. The results show a higher performance of the algorithm when compared to primal simplex methods.

Transmission-expansion planning using the DC model and nonlinear-programming technique

The paper presents a constructive heuristic algorithm (CHA) for solving directly the long-term transmission-network-expansion-planning (LTTNEP) problem using the DC model. The LTTNEP is a very complex mixed-integer nonlinear-programming problem and presents a combinatorial growth in the search space. The CHA is used to find a solution for the LTTNEP problem of good quality. A sensitivity index is used in each step of the CHA to add circuits to the system. This sensitivity index is obtained by solving the relaxed problem of LTTNEP, i.e. considering the number of circuits to be added as a continuous variable. The relaxed problem is a large and complex nonlinear-programming problem and was solved through the interior-point method (IPM). Tests were performed using Garver's system, the modified IEEE 24-Bus system and the Southern Brazilian reduced system. The results presented show the good performance of IPM inside the CHA.

Towards an intelligent graphical interface for linear programming modelling

The increase of computing power of the microcomputers has stimulated the building of direct manipulation interfaces that allow graphical representation of Linear Programming (LP) models. This work discusses the components of such a graphical interface as the basis for a system to assist users in the process of formulating LP problems. In essence, this work proposes a methodology which considers the modelling task as divided into three stages which are specification of the Data Model, the Conceptual Model and the LP Model. The necessity for using Artificial Intelligence techniques in the problem conceptualisation and to help the model formulation task is illustrated.

Determination of neutral polymorphisms (frameworks) of the human beta globin gene in beta thalassaemias by PCR/DGGE

Purpose: Considering the importance of type beta thalassaemias as hereditary syndromes of high significance in different populations of Mediterranean origin and, by extension, in the Brazilian population, the objective of the present study was to determine by PCR/DGGE the gene structures responsible for neutral polymorphisms (frameworks) observed in the human beta globin gene associated with the mutations responsible for type beta thalassaemias in a sample of the Brazilian population and, more specifically, of the population of the State of São Paulo. Patients and methods: Thirty individuals with beta thalassaemic mutations were analyzed: 22 mutations were in codon 39 (C->T), 5 in IVS1-110 (G->A), 2 in IVS1-6 (T->C) and 1 in IVS1-1 (G->A). DNA was extracted and selective amplification was performed by PCR extending from position IVS1 nt 46 to IVS2 nt 126 (474 pb). The product was then analyzed by polyacrylamide gel electrophoresis on a denaturing 10-60% urea/formamide gradient. Results: The results demonstrated that, as expected, the mutations responsible for type beta thalassaemia observed in this population are of Mediterranean origin, with 73% distribution represented by codon 39,17% by IVS1-110, 7% by IVS1-6 and 3% by IVS1-1. In turn, framework distribution seems to indicate a higher frequency of Fr 1-1 in codon 39 and IVS1-110, of Fr 1-3 in IVS1-6 and of Fr 1-2 in IVS1-1. Conclusions: These results permit us to conclude that gene amplification by PCR followed by DGGE is an appropriate method for the separation of DNA molecules that differ even by a single base change and therefore can be utilized to detect the alterations observed in the human beta globin gene. This methodology shows that, using only a pair of primers, it is possible to define the frameworks that are observed in the beta globin gene.

Optimality conditions for pareto nonsmooth nonconvex programming in banach spaces

In this paper, we consider a vector optimization problem where all functions involved are defined on Banach spaces. We obtain necessary and sufficient criteria for optimality in the form of Karush-Kuhn-Tucker conditions. We also introduce a nonsmooth dual problem and provide duality theorems.