Efectos de la reforma contable en la administración local

L' any 2006 entra en vigor una nova instrucció de comptabilitat per a l' administració local que provocarà alguns efectes que s' intenten analitzar en aquest article. En primer lloc, s' analitza el pas de dos models comptables a tres, després s' estudien les modificacions més importants,i s' acaba amb les principals conclusions obtingudes i la repercussió en la gestió comptable

Professionals: entrevista entorn de l'experiència laboral d'un arquitecte

Entrevista a Josep Fuses, arquitecte i professor del Grau d'Arquitectura de la Universitat

La universidad del futuro: impacto de las tecnologias de la información

Article que comenta alguns aspectes relacionats amb les universitats virtuals del futur i que afecten no només als estudiants i al personal docent sinó també als administradors dels pressupostos universitaris

Conversa a Utopia

Joan Manuel del Pozo acaba de publicar la primera traducció catalana directa d’Utopia. Apareguda per primer cop en llatí el 1516, és l’obra més destacable de l’humanista anglès Tomas More, decapitat per protestar contra la pretensió d’Enric VIII d’envair un espai de poder que fins aleshores li havia estat aliè: l’espiritual. Utopia és una illa, i More la va imaginar com un paradís de tolerància religiosa, on no faltava la feina ni els recursos per a tothom. Amb el pretext de l’edició del llibre, Engega ha convidat el filòsof Joan Manuel del Pozo, el químic Miquel Costas i la doctora en Medicina Marta Aymerich, a mantenir una conversa gens utòpica, que us presentem a continuació

Anna Maria Geli: "La Universitat és un servei públic i té l'obligació de retre comptes"

La revista Engega entrevista la Dra. Anna M. Geli, rectora de la Universitat de Girona

One-sided jet at milliarcsecond scales in LS I +61˚ 303

We present Very Long Baseline Interferometry (VLBI) observations of the high mass X-ray binary LS I +61˚303, carried out with the European VLBI Network (EVN). Over the 11 hour observing run, performed ~10 days after a radio outburst, the radio source showed a constant flux density, which allowed sensitive imaging of the emission distribution. The structure in the map shows a clear extension to the southeast. Comparing our data with previous VLBI observations we interpret the extension as a collimated radio jet as found in several other X-ray binaries. Assuming that the structure is the result of an expansion that started at the onset of the outburst, we derive an apparent expansion velocity of 0:003 c, which, in the context of Doppler boosting, corresponds to an intrinsic velocity of at least 0:4 c for an ejection close to the line of sight. From the apparent velocity in all available epochs we are able to establish variations in the ejection angle which imply a precessing accretion disk. Finally we point out that LS I +61˚303, like SS 433 and Cygnus X-1, shows evidence for an emission region almost orthogonal to the relativistic jet

Local map update for large scale SLAM

A technique for simultaneous localisation and mapping (SLAM) for large scale scenarios is presented. This solution is based on the use of independent submaps of a limited size to map large areas. In addition, a global stochastic map, containing the links between adjacent submaps, is built. The information in both levels is corrected every time a loop is closed: local maps are updated with the information from overlapping maps, and the global stochastic map is optimised by means of constrained minimisation

On the use of QoS requirements as base of multicast charging

We propose a charging scheme for cost distribution along a multicast tree when cost is the responsibility of the receivers. This scheme focuses on QoS considerations and it does not depend on any specific type of service. The scheme has been designed to be used as a bridge between unicast and multicast services, solving the problem of charging multicast services by means of unicast charging and existing QoS routing mechanisms. We also include a numerical comparison and discussions of the case of non-numerical or relative QoS and on the application to some service examples in order to give a better understanding of the proposal

Evaluating the probability and the impact of a failure in GMPLS based networks

In this paper, we define a new scheme to develop and evaluate protection strategies for building reliable GMPLS networks. This is based on what we have called the network protection degree (NPD). The 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), which determines the impact on the network in case of failure, in terms of packet loss and recovery time. Having mathematical formulated these components, experimental results demonstrate the benefits of the utilization of the NPD, when used to enhance some current QoS routing algorithms in order to offer a certain degree of protection

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

Minimum interference routing with fast protection

One of the most effective techniques offering QoS routing is minimum interference routing. However, it is complex in terms of computation time and is not oriented toward improving the network protection level. In order to include better levels of protection, new minimum interference routing algorithms are necessary. Minimizing the failure recovery time is also a complex process involving different failure recovery phases. Some of these phases depend completely on correct routing selection, such as minimizing the failure notification time. The level of protection also involves other aspects, such as the amount of resources used. In this case shared backup techniques should be considered. Therefore, minimum interference techniques should also be modified in order to include sharing resources for protection in their objectives. These aspects are reviewed and analyzed in this article, and a new proposal combining minimum interference with fast protection using shared segment backups is introduced. Results show that our proposed method improves both minimization of the request rejection ratio and the percentage of bandwidth allocated to backup paths in networks with low and medium protection requirements

Carrier Ethernet "label" scalability

A collection of slides from the authorpsilas seminar presentation is given

Improving Label Space Usage for Ethernet Label Switched Paths

Ethernet is becoming the dominant aggregation technology for carrier transport networks; however, as it is a LAN technology, native bridged ethernet does not fulfill all the carrier requirements. One of the schemes proposed by the research community to make ethernet fulfill carrier requirements is ethernet VLAN-label switching (ELS). ELS allows the creation of label switched data paths using a 12-bit label encoded in the VLAN TAG control information field. Previous label switching technologies such as MPLS use more bits for encoding the label. Hence, they do not suffer from label sparsity issues as ELS might. This paper studies the sparsity issues resulting from the reduced ELS VLAN-label space and proposes the use of the label merging technique to improve label space usage. Experimental results show that label merging considerably improves label space usage

Admission Control for TCP Flows Using Packet Classes and Edge-to-edge Measurements of Aggregates

TCP flows from applications such as the web or ftp are well supported by a Guaranteed Minimum Throughput Service (GMTS), which provides a minimum network throughput to the flow and, if possible, an extra throughput. We propose a scheme for a GMTS using Admission Control (AC) that is able to provide different minimum throughput to different users and that is suitable for "standard" TCP flows. Moreover, we consider a multidomain scenario where the scheme is used in one of the domains, and we propose some mechanisms for the interconnection with neighbor domains. The whole scheme uses a small set of packet classes in a core-stateless network where each class has a different discarding priority in queues assigned to it. The AC method involves only edge nodes and uses a special probing packet flow (marked as the highest discarding priority class) that is sent continuously from ingress to egress through a path. The available throughput in the path is obtained at the egress using measurements of flow aggregates, and then it is sent back to the ingress. At the ingress each flow is detected using an implicit way and then it is admission controlled. If it is accepted, it receives the GMTS and its packets are marked as the lowest discarding priority classes; otherwise, it receives a best-effort service. The scheme is evaluated through simulation in a simple "bottleneck" topology using different traffic loads consisting of "standard" TCP flows that carry files of varying sizes