J2EE : frameworks de la capa de presentació

Estudi dels marcs de treball Java EE per la capa de presentació d'aplicacions web complexes.

A logic programming framework for possibilistic argumentation: formalization and logical properties

In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has shown to be particularly useful for developing different argument-based frameworks on the basis of different variants of logic programming which incorporate defeasible rules. Most of such frameworks, however, are unable to deal with explicit uncertainty, nor with vague knowledge, as defeasibility is directly encoded in the object language. This paper presents Possibilistic Logic Programming (P-DeLP), a new logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty. Such features are formalized on the basis of PGL, a possibilistic logic based on G¨odel fuzzy logic. One of the applications of P-DeLP is providing an intelligent agent with non-monotonic, argumentative inference capabilities. In this paper we also provide a better understanding of such capabilities by defining two non-monotonic operators which model the expansion of a given program P by adding new weighed facts associated with argument conclusions and warranted literals, respectively. Different logical properties for the proposed operators are studied

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

Estudi i desenvolupament de frameworks de presentació sota la tecnologia J2EE. Anàlisi de les eines existents i construcció d'una proposta pròpia en base a les conclusions obtingudes.

Frameworks Google GWT - Google Guice :Estudi i Desenvolupament aplicació UOCTaskMan

Anàlisi dels frameworks Google, Google Web Toolkit (GWT) i Guice. Desenvolupament d'una eina de gestió de tasques orientat a projectes informàtics (UOCTaskMan). Aquesta aplicació permetrà l'enregistrament de tasques, el seguiment dels diferents estats pels que passai explotació de les dades generades per l'enregistrament i el seguiment.

Frameworks de persistència : un estudi comparatiu

El projecte és un estudi dels distints productes que es poden trobar per aconseguir la persistència dels objectes entre diferents sessions. Aquest projecte s'engloba dins la tecnologia Java 2 Enterprise Edition (J2EE).

Anàlisi i comparativa de frameworks dins de les 3 capes (Vista-Model-Dades) d'una arquitecturatípica JEE

Analitzarem, mitjançant proves de codi que realitzen la mateixa tasca, dels diferentsFramework escollits, la seva eficiència (velocitat i memòria entre d'altres).

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.

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.

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.