The deployment of an e-book consultation and loan service : the experience of the Open University of Catalonia Library

La Biblioteca de la UOC (UOC Library) ha ofert durant tres mesos (octubre-desembre 09), en fase de prova pilot, un servei de consulta i préstec de lectors de llibres electrònics (e-readers). Aquest nou desplegament s'ha desenvolupat en consonància amb l'aposta general de la Universitat en innovació en tecnologies aplicades a l'educació, i la voluntat de potenciar les col·leccions de llibres electrònics i l'ús dels dispositius de lectura de llibres electrònics com una extensió més de la tecnologia del Campus 5.0, en el suport a l'aprenentatge dels seus estudiants durant la seva formació a la Universitat. Aquest treball presenta en detall les especificacions de la prova pilot, a més de contenir una anàlisi i avaluació dels resultats obtinguts: punts forts i punts febles, relació dels aspectes a millorar i modificar, de cara a la consolidació final del servei.

Análisis de las de las funcionalidades 2.0 ofrecidas por los repositorios españoles

Els Repositoris Institucionals suposen un element nou en l'entorn universitari pel que fa a la comunicació científica i a la presència digital de la producció de les universitats. Però l'entorn digital evoluciona molt ràpidament, així com els diferents agents implicats en la publicació científica. El canvi més important en la comunicació web que s'ha donat en els últims anys ha estat l'aparició dels serveis englobats sota l'etiqueta Web 2.0 en què s'inclouen diferents serveis per compartir enllaços, objectes digitals, gestionar relacions socials, reutilitzar informació, etc. Algunes publicacions científiques ja estan oferint aquest tipus de serveis. El present treball analitza el grau d'implantació d'aquest tipus de serveis en l'àmbit dels dipòsits institucionals espanyols. Per això en primer lloc s'identifiquen els tipus de serveis considerats 2.0 i que poden ser d'utilitat per a la comunicació científica. En segon lloc es comptabilitza quines d'aquestes possibilitats son ofertes pels repositoris i per últim s'analitzen els resultats per a comprovar les accions realitzades i identificar les possibles línies de millora.

Open partial nephrectomy in renal cancer: a feasible gold standard technique in all hospitals

Introduction. Partial nephrectomy (PN) is playing an increasingly important role in localized renal cell carcinoma (RCC) as a true alternative to radical nephrectomy. With the greater experience and expertise of surgical teams, it has become an alternative to radical nephrectomy in young patients when the tumor diameter is 4 cm or less in almost all hospitals since cancer-specific survival outcomes are similar to those obtained with radical nephrectomy. Materials and Methods. The authors comment on their own experience and review the literature, reporting current indications and outcomes including complications. The surgical technique of open partial nephrectomy is outlined. Conclusions. Nowadays, open PN is the gold standard technique to treat small renal masses, and all nonablative techniques must pass the test of time to be compared to PN. It is not ethical for patients to undergo radical surgery just because the urologists involved do not have adequate experience with PN. Patients should be involved in the final treatment decision and, when appropriate, referred to specialized centers with experience in open or laparoscopic partial nephrectomies

Experimental Modeling and Control Strategies on an Open Mobile Robot Platform PRIM

This research work deals with the problem of modeling and design of low level speed controller for the mobile robot PRIM. The main objective is to develop an effective educational tool. On one hand, the interests in using the open mobile platform PRIM consist in integrating several highly related subjects to the automatic control theory in an educational context, by embracing the subjects of communications, signal processing, sensor fusion and hardware design, amongst others. On the other hand, the idea is to implement useful navigation strategies such that the robot can be served as a mobile multimedia information point. It is in this context, when navigation strategies are oriented to goal achievement, that a local model predictive control is attained. Hence, such studies are presented as a very interesting control strategy in order to develop the future capabilities of the system

PRIM an Open Mobile Robot Platform. Motivation, Present and Future Trends

This paper is focused on the robot mobile platform PRIM (platform robot information multimedia). This robot has been made in order to cover two main needs of our group, on one hand the need for a full open mobile robotic platform that is very useful in fulfilling the teaching and research activity of our school community, and on the other hand with the idea of introducing an ethical product which would be useful as mobile multimedia information point as a service tool. This paper introduces exactly how the system is made up and explains just what the philosophy is behind this work. The navigation strategies and sensor fusion, where machine vision system is the most important one, are oriented towards goal achievement and are the key to the behaviour of the robot

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

Full label space reduction in MPLS networks: asymmetric merged tunneling

Traffic Engineering objective is to optimize network resource utilization. Although several works have been published about minimizing network resource utilization in MPLS networks, few of them have been focused in LSR label space reduction. This letter studies Asymmetric Merged Tunneling (AMT) as a new method for reducing the label space in MPLS network. The proposed method may be regarded as a combination of label merging (proposed in the MPLS architecture) and asymmetric tunneling (proposed recently in our previous works). Finally, simulation results are performed by comparing AMT with both ancestors. They show a great improvement in the label space reduction factor

Label Space Reduction in MPLS Networks: How Much Can A Single Stacked Label Do?

Most network operators have considered reducing LSR label spaces (number of labels used) as a way of simplifying management of underlaying virtual private networks (VPNs) and therefore reducing operational expenditure (OPEX). The IETF outlined the label merging feature in MPLS-allowing the configuration of multipoint-to-point connections (MP2P)-as a means of reducing label space in LSRs. We found two main drawbacks in this label space reduction a)it should be separately applied to a set of LSPs with the same egress LSR-which decreases the options for better reductions, and b)LSRs close to the edge of the network experience a greater label space reduction than those close to the core. The later implies that MP2P connections reduce the number of labels asymmetrically

All-Optical Label Stacking: Easing the Trade-offs Between Routing and Architecture Cost in All-Optical Packet Switching

All-optical label swapping (AOLS) forms a key technology towards the implementation of all-optical packet switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the way in which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This paper studies all-optical label stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this paper, an integer lineal program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more