PFC : Diseño de un Framework de presentación

L'objectiu principal d'aquest PFC és el disseny i la implementació d'un nou framework de presentació per a aplicacions J2EE, com el seu títol indica, que sigui capaç de solucionar els inconvenients dels actuals frameworks del mercat que implementen aquesta funcionalitat, així com facilitar la implementació de la seva funcionalitat al desenvolupador.

Disseny i implementació d'un marc de treball (framework) de presentació per aplicacions J2EE

En aquest projecte he dissenyat i implementat un marc de treball (framework) de presentació per aplicacions J2EE. Avui en dia, per desenvolupar aplicacions web, estem obligats a que segueixin una sèrie de qualitats per tal de fer-les útils. Aquestes són eficiència, extensibilitat, reutilització i portabilitat. De no ser així, el nostre programari no tindrà lloc al mercat. Per tal d' aconseguir aquestes qualitats, cal seguir les regles establertes i utilitzar frameworks.

Diseño e implementación de un marco de trabajo de presentación para aplicación J2EE

El proyecto pretende definir y crear un conjunto de utilidades y pautas de programación que permitan al programador implementar aplicaciones J2EE siguiendo el patrón de diseño MVC.

A teaching/learning support tool for introductory programming courses

In This work we present a Web-based tool developed with the aim of reinforcing teaching and learning of introductory programming courses. This tool provides support for teaching and learning. From the teacher's perspective the system introduces important gains with respect to the classical teaching methodology. It reinforces lecture and laboratory sessions, makes it possible to give personalized attention to the student, assesses the degree of participation of the students and most importantly, performs a continuous assessment of the student's progress. From the student's perspective it provides a learning framework, consisting in a help environment and a correction environment, which facilitates their personal work. With this tool students are more motivated to do programming

Frameworks per a la implementació àgil de la capa de presentació

En aquest projecte inicialment es donarà una visió global del J2EE aprofundint especialment en els components que s'acostumen a utilitzar a la capa de presentació, com son els servlets. A més, es descriuran tecnologies i eines de JAVA que semblen no estar relacionades amb aquesta capa, però que es poden aprofitar pel facilitar la feina dels programadors.

A Thematic Comparison of Eight Frameworks of Quality Criteria in Qualitative Health Research

Background: Despite the increasing incidences of the publication of assessment frameworks intending to establish the "standards" of the quality of qualitative research, the research conducted using such empirical methods are still facing difficulties in being published or recognised by funding agencies. Methods: We conducted a thematic content analysis of eight frameworks from psychology/psychiatry and general medicine. The frameworks and their criteria are then compared against each other. Findings: The results illustrated the difficulties in reaching consensus on the definition of quality criteria. This showed the differences between the frameworks from the point of views of the underlying epistemology and the criteria suggested. Discussion: The aforementioned differences reflect the diversity of paradigms implicitly referred to by the authors of the frameworks, although rarely explicitly mentioned in text. We conclude that the increase in qualitative research and publications has failed to overcome the difficulties in establishing shared criteria and the great heterogeneity of concepts raises methodological and epistemological problems.

Let's talk: public evaluation of large projects: variational inequialities, bilevel programming and complementarity. a survey

Large projects evaluation rises well known difficulties because -by definition- they modify the current price system; their public evaluation presents additional difficulties because they modify too existing shadow prices without the project. This paper analyzes -first- the basic methodologies applied until late 80s., based on the integration of projects in optimization models or, alternatively, based on iterative procedures with information exchange between two organizational levels. New methodologies applied afterwards are based on variational inequalities, bilevel programming and linear or nonlinear complementarity. Their foundations and different applications related with project evaluation are explored. As a matter of fact, these new tools are closely related among them and can treat more complex cases involving -for example- the reaction of agents to policies or the existence of multiple agents in an environment characterized by common functions representing demands or constraints on polluting emissions.

Portraying innovation in the public service of Brazil: Frameworks, systematization and characterization

ABSTRACT Innovation is essential for improving organizational performance in both the private and public sectors. This article describes and analyzes the 323 innovation experiences of the Brazilian federal public service that received prizes during the 16 annual competitions (from 1995 to 2012) of the Award for Innovation in Federal Public Management held by the Brazilian National School of Public Administration (ENAP). It is a qualitative and quantitative study in which were employed as categories for analysis the four types of innovation defined in the Copenhagen Manual: product, process, organizational and communication. The survey results allow us to affirm that there is innovation in the public sector, in spite of the skepticism of some researchers and the incipient state of theoretical research on the subject. It was possible to observe that organizational innovation was the one with the highest number of award- -winning experience, followed respectively by process, communication and product innovation, with citizen services and improvement of work processes being the main highlights. The results showed that, although the high incidence of innovation occurs at the national level, a significant number of innovations also occur at the local level, probably because many organizations of the federal government have their actions spread only at this level of government. Concerning the innovative area, health and education predominate, with almost 33% of initiatives, which can be explained by capillarity of these areas and the fact that both maintain a strong interaction with the user. The contributions of this work include the use of theoretical model of innovation analysis in the public sector in Brazil still upcoming, and the systematization of knowledge in empirical basis for this innovation. In this sense, it also contributes to the development of the theory with the presentation of evidence that the characteristics, determinants and consequences of innovation in the public sector differ not only from innovation in the industry, but also from innovation in services in the private sector.

Comparison of Work Scheduling Using Constraint Programming or Auctions

Business processes designers take into account the resources that the processes would need, but, due to the variable cost of certain parameters (like energy) or other circumstances, this scheduling must be done when business process enactment. In this report we formalize the energy aware resource cost, including time and usage dependent rates. We also present a constraint programming approach and an auction-based approach to solve the mentioned problem including a comparison of them and a comparison of the proposed algorithms for solving them

Assembling genes from predicted exons in linear time with dynamic programming

In a number of programs for gene structure prediction in higher eukaryotic genomic sequences, exon prediction is decoupled from gene assembly: a large pool of candidate exons is predicted and scored from features located in the query DNA sequence, and candidate genes are assembled from such a pool as sequences of nonoverlapping frame-compatible exons. Genes are scored as a function of the scores of the assembled exons, and the highest scoring candidate gene is assumed to be the most likely gene encoded by the query DNA sequence. Considering additive gene scoring functions, currently available algorithms to determine such a highest scoring candidate gene run in time proportional to the square of the number of predicted exons. Here, we present an algorithm whose running time grows only linearly with the size of the set of predicted exons. Polynomial algorithms rely on the fact that, while scanning the set of predicted exons, the highest scoring gene ending in a given exon can be obtained by appending the exon to the highest scoring among the highest scoring genes ending at each compatible preceding exon. The algorithm here relies on the simple fact that such highest scoring gene can be stored and updated. This requires scanning the set of predicted exons simultaneously by increasing acceptor and donor position. On the other hand, the algorithm described here does not assume an underlying gene structure model. Indeed, the definition of valid gene structures is externally defined in the so-called Gene Model. The Gene Model specifies simply which gene features are allowed immediately upstream which other gene features in valid gene structures. This allows for great flexibility in formulating the gene identification problem. In particular it allows for multiple-gene two-strand predictions and for considering gene features other than coding exons (such as promoter elements) in valid gene structures.

A randomized concave programming method for choice network revenue management

Models incorporating more realistic models of customer behavior, as customers choosing froman offer set, have recently become popular in assortment optimization and revenue management.The dynamic program for these models is intractable and approximated by a deterministiclinear program called the CDLP which has an exponential number of columns. However, whenthe segment consideration sets overlap, the CDLP is difficult to solve. Column generationhas been proposed but finding an entering column has been shown to be NP-hard. In thispaper we propose a new approach called SDCP to solving CDLP based on segments and theirconsideration sets. SDCP is a relaxation of CDLP and hence forms a looser upper bound onthe dynamic program but coincides with CDLP for the case of non-overlapping segments. Ifthe number of elements in a consideration set for a segment is not very large (SDCP) can beapplied to any discrete-choice model of consumer behavior. We tighten the SDCP bound by(i) simulations, called the randomized concave programming (RCP) method, and (ii) by addingcuts to a recent compact formulation of the problem for a latent multinomial-choice model ofdemand (SBLP+). This latter approach turns out to be very effective, essentially obtainingCDLP value, and excellent revenue performance in simulations, even for overlapping segments.By formulating the problem as a separation problem, we give insight into why CDLP is easyfor the MNL with non-overlapping considerations sets and why generalizations of MNL posedifficulties. We perform numerical simulations to determine the revenue performance of all themethods on reference data sets in the literature.

A new compact linear programming formulation for choice network revenue management

The choice network revenue management model incorporates customer purchase behavioras a function of the offered products, and is the appropriate model for airline and hotel networkrevenue management, dynamic sales of bundles, and dynamic assortment optimization.The optimization problem is a stochastic dynamic program and is intractable. A certainty-equivalencerelaxation of the dynamic program, called the choice deterministic linear program(CDLP) is usually used to generate dyamic controls. Recently, a compact linear programmingformulation of this linear program was given for the multi-segment multinomial-logit (MNL)model of customer choice with non-overlapping consideration sets. Our objective is to obtaina tighter bound than this formulation while retaining the appealing properties of a compactlinear programming representation. To this end, it is natural to consider the affine relaxationof the dynamic program. We first show that the affine relaxation is NP-complete even for asingle-segment MNL model. Nevertheless, by analyzing the affine relaxation we derive a newcompact linear program that approximates the dynamic programming value function betterthan CDLP, provably between the CDLP value and the affine relaxation, and often comingclose to the latter in our numerical experiments. When the segment consideration sets overlap,we show that some strong equalities called product cuts developed for the CDLP remain validfor our new formulation. Finally we perform extensive numerical comparisons on the variousbounds to evaluate their performance.

On the throughput-WIP trade-off in queueing systems, diminishing returns and the threshold property: A linear programming approach

We present a new unifying framework for investigating throughput-WIP(Work-in-Process) optimal control problems in queueing systems,based on reformulating them as linear programming (LP) problems withspecial structure: We show that if a throughput-WIP performance pairin a stochastic system satisfies the Threshold Property we introducein this paper, then we can reformulate the problem of optimizing alinear objective of throughput-WIP performance as a (semi-infinite)LP problem over a polygon with special structure (a thresholdpolygon). The strong structural properties of such polygones explainthe optimality of threshold policies for optimizing linearperformance objectives: their vertices correspond to the performancepairs of threshold policies. We analyze in this framework theversatile input-output queueing intensity control model introduced byChen and Yao (1990), obtaining a variety of new results, including (a)an exact reformulation of the control problem as an LP problem over athreshold polygon; (b) an analytical characterization of the Min WIPfunction (giving the minimum WIP level required to attain a targetthroughput level); (c) an LP Value Decomposition Theorem that relatesthe objective value under an arbitrary policy with that of a giventhreshold policy (thus revealing the LP interpretation of Chen andYao's optimality conditions); (d) diminishing returns and invarianceproperties of throughput-WIP performance, which underlie thresholdoptimality; (e) a unified treatment of the time-discounted andtime-average cases.

Implementing TURF analysis through binary linear programming

This paper introduces the approach of using Total Unduplicated Reach and Frequency analysis (TURF) to design a product line through a binary linear programming model. This improves the efficiency of the search for the solution to the problem compared to the algorithms that have been used to date. The results obtained through our exact algorithm are presented, and this method shows to be extremely efficient both in obtaining optimal solutions and in computing time for very large instances of the problem at hand. Furthermore, the proposed technique enables the model to be improved in order to overcome the main drawbacks presented by TURF analysis in practice.