A programmably loadable control store for the Burroughs D-machine /

Originally presented as the author's thesis, University of Illinois at Urbana-Champaign.

Rehabilitació i control d'un manipulador industrial

El grup de visió per computadora de la Universitat de Girona, disposava d’un manipulador lineal com a sistema de posicionament, per poder inspeccionar mitjançant visió artificial, la superfície de diverses peces. El control es realitzava a partir d’un PLC, controlant la posició de la plataforma de posicionament a partir d’un servomotor, un servocontrolador i una targeta d’entrada i sortida de polsos. Es pretén la recuperació d’aquest sistema de posicionament lineal a partir de la recopilació de la informació inicial. El nou ús serà enfocat al posicionament i a la classificació de diversos elements. D’aquesta forma es podrà estudiar el funcionament d’un servomotor governat per un servodriver i una targeta d’entrada i sortida de polsos i s’utilitzarà com a element didàctic per a la universitat. Es complementarà la documentació disponible i s’elaborarà informació tècnica

Experimental validation of a 3-D vision-based measurement system applied to robot calibration

One of the problems that slows the development of off-line programming is the low static and dynamic positioning accuracy of robots. Robot calibration improves the positioning accuracy and can also be used as a diagnostic tool in robot production and maintenance. A large number of robot measurement systems are now available commercially. Yet, there is a dearth of systems that are portable, accurate and low cost. In this work a measurement system that can fill this gap in local calibration is presented. The measurement system consists of a single CCD camera mounted on the robot tool flange with a wide angle lens, and uses space resection models to measure the end-effector pose relative to a world coordinate system, considering radial distortions. Scale factors and image center are obtained with innovative techniques, making use of a multiview approach. The target plate consists of a grid of white dots impressed on a black photographic paper, and mounted on the sides of a 90-degree angle plate. Results show that the achieved average accuracy varies from 0.2mm to 0.4mm, at distances from the target from 600mm to 1000mm respectively, with different camera orientations.

Rehabilitació i control d'un manipulador industrial

El grup de visió per computadora de la Universitat de Girona, disposava d’un manipulador lineal com a sistema de posicionament, per poder inspeccionar mitjançant visió artificial, la superfície de diverses peces. El control es realitzava a partir d’un PLC, controlant la posició de la plataforma de posicionament a partir d’un servomotor, un servocontrolador i una targeta d’entrada i sortida de polsos. Es pretén la recuperació d’aquest sistema de posicionament lineal a partir de la recopilació de la informació inicial. El nou ús serà enfocat al posicionament i a la classificació de diversos elements. D’aquesta forma es podrà estudiar el funcionament d’un servomotor governat per un servodriver i una targeta d’entrada i sortida de polsos i s’utilitzarà com a element didàctic per a la universitat. Es complementarà la documentació disponible i s’elaborarà informació tècnica

Instructions for operating Burroughs visible adding and listing machines.

Mode of access: Internet.

Enhancing fault management performance of two-step QoS routing algorithms in GMPLS networks

In this paper a novel methodology aimed at minimizing the probability of network failure and the failure impact (in terms of QoS degradation) while optimizing the resource consumption is introduced. A detailed study of MPLS recovery techniques and their GMPLS extensions are also presented. In this scenario, some features for reducing the failure impact and offering minimum failure probabilities at the same time are also analyzed. Novel two-step routing algorithms using this methodology are proposed. Results show that these methods offer high protection levels with optimal resource consumption

Enhancing MPLS QoS routing algorithms by using the network protection degree paradigm

IP based networks still do not have the required degree of reliability required by new multimedia services, achieving such reliability will be crucial in the success or failure of the new Internet generation. Most of existing schemes for QoS routing do not take into consideration parameters concerning the quality of the protection, such as packet loss or restoration time. In this paper, we define a new paradigm to develop new protection strategies for building reliable MPLS networks, based on what we have called the network protection degree (NPD). This NPD consists of an a priori evaluation, the failure sensibility degree (FSD), which provides the failure probability and an a posteriori evaluation, the failure impact degree (FID), to determine the impact on the network in case of failure. Having mathematical formulated these components, we point out the most relevant components. Experimental results demonstrate the benefits of the utilization of the NPD, when used to enhance some current QoS routing algorithms to offer a certain degree of protection

Availability analysis of GMPLS connections based on physical network topology

This paper presents a study of connection availability in GMPLS over optical transport networks (OTN) taking into account different network topologies. Two basic path protection schemes are considered and compared with the no protection case. The selected topologies are heterogeneous in geographic coverage, network diameter, link lengths, and average node degree. Connection availability is also computed considering the reliability data of physical components and a well-known network availability model. Results show several correspondences between suitable path protection algorithms and several network topology characteristics

On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced

Enhanced multi-layer protection in multi-service GMPLS networks

This paper focuses on QoS routing with protection in an MPLS network over an optical layer. In this multi-layer scenario each layer deploys its own fault management methods. A partially protected optical layer is proposed and the rest of the network is protected at the MPLS layer. New protection schemes that avoid protection duplications are proposed. Moreover, this paper also introduces a new traffic classification based on the level of reliability. The failure impact is evaluated in terms of recovery time depending on the traffic class. The proposed schemes also include a novel variation of minimum interference routing and shared segment backup computation. A complete set of experiments proves that the proposed schemes are more efficient as compared to the previous ones, in terms of resources used to protect the network, failure impact and the request rejection ratio

Entorn de simulació per a xarxes òptiques de transport

Aquest projecte final de carrera pretén investigar i experimentar una nova línia de desenvolupament d’algorismes dinàmics. A partir de l’algorisme AntNet-QoS [2] s’ incorporen noves mesures a l’algorisme (mesura de l’amplada de banda disponible i jitter), les quals combinant amb la mesura de retard ja feta servir, permet adaptar-se millor a les condicions actuals del trànsit en la xarxa i als requeriments específics de qualitat (QoS) per part del trànsit

Generador de dossiers

La plataforma ACME (Avaluació Continuada i Millora de l’Ensenyament) va ser creada l’any 1998 per un grup de professors del departament d’Informàtica i Matemàtica Aplicada de la Universitat de Girona.L’ACME es va concebre com una plataforma d’e-learning, és a dir, un sistema que mitjançant l’ús d’Internet afavorís l’aprenentatge, permeten la interactivitat entre alumne i professor sobre un temari comú.Actualment l’ACME s’utilitza com a complement a les classes presencials, on el professor exposa de manera magistral els conceptes i resol algun exercici a mode d’exemple, per tal que després l’alumne, utilitzant la plataforma ACME, intenti resoldre els exercicis proposats pel professorL’objectiu d’aquest Projecte Final de Carrera és desenvolupar l’anàlisi, disseny i implementació de les modificacions necessàries a incorporar a la plataforma ACME per tal de generar documents PDF dels exercicis de l’ACME. El projecte consta de tres parts: Permetre que l’alumne sigui capaç d’obtenir un fitxer en el qual hi hagin tots els exercicis de l’assignatura escollida, El professor també podrà obtenir el dossier d’un alumne en concret, permetre que el professor pugui generar un dossier de problemes base a partir dels exercicis que hagi seleccionat del repositori i permetre que el professor pugui generar un conjunt de dossiers de problemes per a després repartir entre els seus alumnes

Paral·lelització especulativa de programes sobre un clúster

Estudi sobre la millora de rendiment (en temps d’execució) al'algorisme de gràfics Fast Multipath Radiosity Using Hierarchical Subscenes gràcies a l’execució paral•lela especulada que ens permet obtenir el motor d'especulació per a clústers desenvolupat en el grup de recerca BCDS de la Universitat de Girona