Aplicación web para la gestión de incidencias en entornos virtuales

Proyecto final de carrera sobre aplicaciones web para trabajo colaborativo, enfocado en una aplicación web para la gestión de incidencias en entornos virtuales como la UOC.

Aplicación web para gestión de incidencias en un departamento de informática

Prototipo aplicación web para trabajo colaborativo que sirve para la gestión de incidencias en un departamento de informática, con gestión de usuarios, grupos de usuarios, incidencias y base de datos de conocimiento.

Registro de incidencias : seguridad en ficheros automatizados. Protección de datos de carácter personal (DD.CC.PP.)

El proyecto de Registro Automatizado de Incidencias tiene como objeto el desarrollo de un software que permita realizar el procedimiento de notificación, gestión y respuesta ante las incidencias. Se considerarán como "incidencias de seguridad", entre otras, cualquier incumplimiento de la normativa desarrollada en el Documento de Seguridad, así como a cualquier anomalía que afecte o pueda afectar a la seguridad de los datos de carácter personal.

Proyecto de dirección de sistemas de información : Open Service Center

El objetivo de este proyecto, Open Service Center, ha consistido en la definición de la arquitectura para una plataforma integrada de herramientas de Software Libre que den soporte a la gestión de servicios TI de diferentes áreas de negocio.

FEMA’s Capability Development After Katrina

After Action Reports for Hurricane Isaac & Sandy concluded that WebEOC was correct choice for FEMA’s Crisis Management System: real time data easily shared between FEMA Headquarters, Regions and Incident Management Assistance Teams; cloud capability allowed use on any web connected device, laptop, tablet, iPad, smart phone; intuitive System - Offgoing personnel able to train incoming reliefs on new features or changes within minutes; widespread use of WebEOC through out country in 19 other Federal Departments and Agencies, 40 States, hundreds of cities/counties and industry provided a number of users that had prior experience using WebEOC and reduced learning curve experienced when new systems are introduced; focusing on a single shared web database reduced creation of new single purpose databases, spreadsheets and share point sites allowing best practices to be captured, refined, shared and continued

Present and future methodology for the implementation of decision support systems for traffic management

Real-time predictions are an indispensable requirement for traffic management in order to be able to evaluate the effects of different available strategies or policies. The combination of predicting the state of the network and the evaluation of different traffic management strategies in the short term future allows system managers to anticipate the effects of traffic control strategies ahead of time in order to mitigate the effect of congestion. This paper presents the current framework of decision support systems for traffic management based on short and medium-term predictions and includes some reflections on their likely evolution, based on current scientific research and the evolution of the availability of new types of data and their associated methodologies.

MONALISA 2.0 and the sea traffic management - a concept creating the need for new maritime information standards and software solutions

Postprint (published version)

An ATM distributed simulator for network management research

Due to the high cost of a large ATM network working up to full strength to apply our ideas about network management, i.e., dynamic virtual path (VP) management and fault restoration, we developed a distributed simulation platform for performing our experiments. This platform also had to be capable of other sorts of tests, such as connection admission control (CAC) algorithms, routing algorithms, and accounting and charging methods. The platform was posed as a very simple, event-oriented and scalable simulation. The main goal was the simulation of a working ATM backbone network with a potentially large number of nodes (hundreds). As research into control algorithms and low-level, or rather cell-level methods, was beyond the scope of this study, the simulation took place at a connection level, i.e., there was no real traffic of cells. The simulated network behaved like a real network accepting and rejecting SNMP ones, or experimental tools using the API node

Parallel scheduling of multiclass M/M/m queues: Approximate and heavy-traffic optimization of achievable performance

We address the problem of scheduling a multiclass $M/M/m$ queue with Bernoulli feedback on $m$ parallel servers to minimize time-average linear holding costs. We analyze the performance of a heuristic priority-index rule, which extends Klimov's optimal solution to the single-server case: servers select preemptively customers with larger Klimov indices. We present closed-form suboptimality bounds (approximate optimality) for Klimov's rule, which imply that its suboptimality gap is uniformly bounded above with respect to (i) external arrival rates, as long as they stay within system capacity;and (ii) the number of servers. It follows that its relativesuboptimality gap vanishes in a heavy-traffic limit, as external arrival rates approach system capacity (heavy-traffic optimality). We obtain simpler expressions for the special no-feedback case, where the heuristic reduces to the classical $c \mu$ rule. Our analysis is based on comparing the expected cost of Klimov's ruleto the value of a strong linear programming (LP) relaxation of the system's region of achievable performance of mean queue lengths. In order to obtain this relaxation, we derive and exploit a new set ofwork decomposition laws for the parallel-server system. We further report on the results of a computational study on the quality of the $c \mu$ rule for parallel scheduling.

Assessing an intuitive condition for stability under a range of traffic conditions via a generalised Lu-Kumar network

We argue the importance both of developing simple sufficientconditions for the stability of general multiclass queueing networks and also of assessing such conditions under a range of assumptions on the weight of the traffic flowing between service stations. To achieve the former, we review a peak-rate stability condition and extend its range of application and for the latter, we introduce a generalisation of the Lu-Kumar network on which the stability condition may be tested for a range of traffic configurations. The peak-rate condition is close to exact when the between-station traffic is light, but degrades as this traffic increases.

Framework for Traffic Pattern Identification: Required Step for Short-term Forecasting

In the world of transport management, the term ‘anticipation’ is gradually replacing ‘reaction’. Indeed, the ability to forecast traffic evolution in a network should ideally form the basis for many traffic management strategies and multiple ITS applications. Real-time prediction capabilities are therefore becoming a concrete need for the management of networks, both for urban and interurban environments, and today’s road operator has increasingly complex and exacting requirements. Recognising temporal patterns in traffic or the manner in which sequential traffic events evolve over time have been important considerations in short-term traffic forecasting. However, little work has been conducted in the area of identifying or associating traffic pattern occurrence with prevailing traffic conditions. This paper presents a framework for detection pattern identification based on finite mixture models using the EM algorithm for parameter estimation. The computation results have been conducted taking into account the traffic data available in an urban network.

Shaping urban traffic patterns through congestion charging : What factors drive success or failure?

Congestion costs are emerging as one of the most important challenges faced by metropolitan planners and transport authorities in first world economies. In US these costs were as high as 78 million dollars in 2005 and are growing due to fast increases in travel delays. In order to solve the current and severe levels of congestion the US department of transportation have recently started a program to initiate congestion pricing in five metropolitan areas. In this context it is important to determine those factors helping its implementation and success, but also the problems or difficulties associated with charging projects. In this article we analyze worldwide experiences with urban road charging in order to extract interesting and helpful lessons for policy makers engaged in congestion pricing projects and for those interested in the introduction of traffic management tools to regulate the entrance to big cities.