Unconstrained optimization with MINTOOLKIT for GNU octave

The paper documents MINTOOLKIT for GNU Octave. MINTOOLKIT provides functions for minimization and numeric differentiation. The main algorithms are BFGS, LBFGS, and simulated annealing. Examples are given.

Use and users of electronic journals at Catalan universities: the results of a survey

Es presenten els resultats d’una enquesta sobre l’ús de revistes electròniques realitzada al professorat de les universitats que formen el Consorci de Biblioteques Universitàries de Catalunya (CBUC). Els resultats mostren un elevat grau de coneixement de la col·lecció de revistes electròniques entre el personal docent i investigador i una creixent preferència pel format electrònic en detriment de l’imprès. L’alt grau de coneixement i d’ús dels títols electrònics, i la preferència per aquest suport, comporten una elevada valoració de la col·lecció de revistes electròniques. Al mateix temps, la major part dels usuaris preveu un increment de l’ús dels títols electrònics durant els propers anys. Els resultats també confirmen la importància de la disciplina i de l’edat com a factors explicatius de l’ús de les revistes electròniques.

Implementació d'un Laboratori Virtual d'Equips Electrònics per múltiples aplicacions específiqies com a reforç docent en l'àrea de l'electrònica VERiLAB (Virtual ElectRonic LABoratory)

S’ha dissenyat un Laboratori Virtual d’Equips Electrònics per múltiples aplicacions específiques com a reforç docent en l’àrea de l’electrònica VERiLAB (Virtual ElectRonic LABoratory) i, a més, s’han dissenyat un conjunt de 9 pràctiques guiades per treure el màxim rendiment al laboratori virtual. El laboratori Virtual és una potent eina de treball per aplicacions docents com a programari d’iniciació a la utilització d’equips electrònics bàsics que podem trobar a qualsevol laboratori d’electrònica. Aquesta eina permet augmentar el nombre d’hores de treball pràctic fora del laboratori. La primera versió d’aquest programari es va dissenyar a l’any 2004 a la Universitat de Barcelona amb el software LabVIEW_7, el qual permet obtenir un fitxer executable amb el qual els alumnes poden treballar fora del laboratori. D’aquesta forma els alumnes únicament necessiten un ordinador per a poder fer les pràctiques. La primera versió del laboratori disposava d’un generador de funcions, un oscil·loscopi i un analitzador d’espectres com a equips electrònics, i a més a més incorporava un mòdul de filtres i un motor DC per treballar amb els equips. La versió 2 del Laboratori Virtual es va desenvolupar amb aquest projecte MQD i es va introduir una font d’alimentació, un multímetre de sobre taula i un portàtil com a equips electrònics. Es van crear també diferents mòduls de sistemes electrònics: filtres analògics, configuracions bàsiques basades en l’amplificador operacional, l’amplificador operacional no ideal i un circuit de rectificació d’ona completa. Aquests mòduls han premés ampliar el camp d’aplicació del Laboratori Virtual a diferents assignatures de l’àrea de l’electrònica.

Analysis and optimization of the satellite-to-plane link of an aeronautical global system

En aquest projecte s’ha analitzat i optimitzat l’enllaç satèl·lit amb avió per a un sistema aeronàutic global. Aquest nou sistema anomenat ANTARES està dissenyat per a comunicar avions amb estacions base mitjançant un satèl·lit. Aquesta és una iniciativa on hi participen institucions oficials en l’aviació com ara l’ECAC i que és desenvolupat en una col·laboració europea d’universitats i empreses. El treball dut a terme en el projecte compren bàsicament tres aspectes. El disseny i anàlisi de la gestió de recursos. La idoneïtat d’utilitzar correcció d’errors en la capa d’enllaç i en cas que sigui necessària dissenyar una opció de codificació preliminar. Finalment, estudiar i analitzar l’efecte de la interferència co-canal en sistemes multifeix. Tots aquests temes són considerats només per al “forward link”. L’estructura que segueix el projecte és primer presentar les característiques globals del sistema, després centrar-se i analitzar els temes mencionats per a poder donar resultats i extreure conclusions.

Line search multilevel optimization as computational methods for dense optical flow

We evaluate the performance of different optimization techniques developed in the context of optical flowcomputation with different variational models. In particular, based on truncated Newton methods (TN) that have been an effective approach for large-scale unconstrained optimization, we develop the use of efficient multilevel schemes for computing the optical flow. More precisely, we evaluate the performance of a standard unidirectional multilevel algorithm - called multiresolution optimization (MR/OPT), to a bidrectional multilevel algorithm - called full multigrid optimization (FMG/OPT). The FMG/OPT algorithm treats the coarse grid correction as an optimization search direction and eventually scales it using a line search. Experimental results on different image sequences using four models of optical flow computation show that the FMG/OPT algorithm outperforms both the TN and MR/OPT algorithms in terms of the computational work and the quality of the optical flow estimation.

Preserving Electronic Theses through the MetaArchive network

In the recent years most libraries have focused on mass digitization programs and keeping electronic born documents, showing and organizing them in a repository. While those repositories have evolved to a much more manageable systems focusing on the user expectations and introducing web 2.0 tools, digital preservation is still in the to-do list of most of them. There is quite a lot of studies focused on preservation and some complex models exist, unfortunately, very few practical systems are running and its quite difficult for a library to get involved in a solution already tested by others. The CBUC (Consortium of University Catalan Libraries) runs TDX, an ETD repository now keeping more than 10.000 full text thesis from any of the 12 university members. After 10 years running TDX a solid preservation system was needed to ensure every thesis would be kept as it was regardless what happens to the repository. The perfect solution was found in the MetaArchive cooperative, this is the effort of many insitutions to keep a copy of each other content through a newtwork using the LOCKSS software as a mechanism to keep track of any change. The presentation will shortly introduce what TDX and MetaArchive is but will, in a practical way, show how the LOCKSS network for presrervation works. Finally a summary of the benefits of the overall experience will be shown.

An algorithm for semi-infinite polynomial optimization

"Vegeu el resum a l'inici del document del fitxer adjunt."

A linear optimization technique for graph pebbling

Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is NP 2 -complete. In this paper we develop a tool, called theWeight Function Lemma, for computing upper bounds and sometimes exact values for pebbling numbers with the assistance of linear optimization. With this tool we are able to calculate the pebbling numbers of much larger graphs than in previous algorithms, and much more quickly as well. We also obtain results for many families of graphs, in many cases by hand, with much simpler and remarkably shorter proofs than given in previously existing arguments (certificates typically of size at most the number of vertices times the maximum degree), especially for highly symmetric graphs. Here we apply theWeight Function Lemma to several specific graphs, including the Petersen, Lemke, 4th weak Bruhat, Lemke squared, and two random graphs, as well as to a number of infinite families of graphs, such as trees, cycles, graph powers of cycles, cubes, and some generalized Petersen and Coxeter graphs. This partly answers a question of Pachter, et al., by computing the pebbling exponent of cycles to within an asymptotically small range. It is conceivable that this method yields an approximation algorithm for graph pebbling.

A parameter-free approach for solving combinatorial optimization problems through biased randomization of efficient heuristics

This paper discusses the use of probabilistic or randomized algorithms for solving combinatorial optimization problems. Our approach employs non-uniform probability distributions to add a biased random behavior to classical heuristics so a large set of alternative good solutions can be quickly obtained in a natural way and without complex conguration processes. This procedure is especially useful in problems where properties such as non-smoothness or non-convexity lead to a highly irregular solution space, for which the traditional optimization methods, both of exact and approximate nature, may fail to reach their full potential. The results obtained are promising enough to suggest that randomizing classical heuristics is a powerful method that can be successfully applied in a variety of cases.

On the stability of the optimal value and the optimal set in optimization problems

The paper develops a stability theory for the optimal value and the optimal set mapping of optimization problems posed in a Banach space. The problems considered in this paper have an arbitrary number of inequality constraints involving lower semicontinuous (not necessarily convex) functions and one closed abstract constraint set. The considered perturbations lead to problems of the same type as the nominal one (with the same space of variables and the same number of constraints), where the abstract constraint set can also be perturbed. The spaces of functions involved in the problems (objective and constraints) are equipped with the metric of the uniform convergence on the bounded sets, meanwhile in the space of closed sets we consider, coherently, the Attouch-Wets topology. The paper examines, in a unified way, the lower and upper semicontinuity of the optimal value function, and the closedness, lower and upper semicontinuity (in the sense of Berge) of the optimal set mapping. This paper can be seen as a second part of the stability theory presented in [17], where we studied the stability of the feasible set mapping (completed here with the analysis of the Lipschitz-like property).

Dissolution of Dynamic Electronic Institutions, a first approach: Relevant factors and causes

In the context of the digital business ecosystems, small organizations cooperate between them in order to achieve common goals or offer new services for expanding their markets. There are different approaches for these cooperation models such as virtual enterprises, virtual organizations or dynamic electronic institutions which in their lifecycle have in common a dissolution phase. However this phase has not been studied deeply in the current literature and it lacks formalization. In this paper a first approach for achieving and managing the dissolution phase is proposed, as well as a CBR process in order to support it in a multi-agent system

Electronic voting system for computer supported collaborative learning

The EVS4CSCL project starts in the context of a Computer Supported Collaborative Learning environment (CSCL). Previous UOC projects created a CSCL generic platform (CLPL) to facilitate the development of CSCL applications. A discussion forum (DF) was the first application developed over the framework. This discussion forum was different from other products on the marketplace because of its focus on the learning process. The DF carried out the specification and elaboration phases from the discussion learning process but there was a lack in the consensus phase. The consensus phase in a learning environment is not something to be achieved but tested. Common tests are done by Electronic Voting System (EVS) tools, but consensus test is not an assessment test. We are not evaluating our students by their answers but by their discussion activity. Our educational EVS would be used as a discussion catalyst proposing a discussion about the results after an initial query or it would be used after a discussion period in order to manifest how the discussion changed the students mind (consensus). It should be also used by the teacher as a quick way to know where the student needs some reinforcement. That is important in a distance-learning environment where there is no direct contact between the teacher and the student and it is difficult to detect the learning lacks. In an educational environment, assessment it is a must and the EVS will provide direct assessment by peer usefulness evaluation, teacher marks on every query created and indirect assessment from statistics regarding the user activity.

Route optimization and customization using real geographical data in Android mobile devices

Nowadays, there are several services and applications that allow users to locate and move to different tourist areas using a mobile device. These systems can be used either by internet or downloading an application in concrete places like a visitors centre. Although such applications are able to facilitate the location and the search for points of interest, in most cases, these services and applications do not meet the needs of each user. This paper aims to provide a solution by studying the main projects, services and applications, their routing algorithms and their treatment of the real geographical data in Android mobile devices, focusing on the data acquisition and treatment to improve the routing searches in off-line environments.

Algorithm creation and optimization for the crew pairing problem

Algoritmo que optimiza y crea pairings para tripulaciones de líneas aéreas mediante la posterior programación en Java.

Optimization of floor cleaning coverage performance of a random path-planning mobile robot

Floor cleaning is a typical robot application. There are several mobile robots aviable in the market for domestic applications most of them with random path-planning algorithms. In this paper we study the cleaning coverage performances of a random path-planning mobile robot and propose an optimized control algorithm, some methods to estimate the are of the room, the evolution of the cleaning and the time needed for complete coverage.