Search

Copyright of Ayer: Revista de Historia Contemporánea is the property of Asociacion de Historia Contemporanea and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Policy management requirements for, and implemented policy management functionality in, two areas of configuration management are examined and reported: network provisioning, and end-to-end routing.

Recent works have made significant progress in novelty detection, i.e., the problem of detecting samples of novel classes, never seen during training, while classifying those that belong to known classes. However, the only information this task provides about novel samples is that they are unknown. In this work, we leverage hierarchical taxonomies of classes to provide informative outputs for samples of novel classes. We predict their closest class in the taxonomy, i.e., its parent class. We address this problem, known as hierarchical novelty detection, by proposing a novel loss, namely Hierarchical Cosine Loss that is designed to learn class prototypes along with an embedding of discriminative features consistent with the taxonomy. We apply it to traffic sign recognition, where we predict the parent class semantics for new types of traffic signs. Our model beats state-of-the art approaches on two large scale traffic sign benchmarks, Mapillary Traffic Sign Dataset (MTSD) and Tsinghua-Tencent 100K (TT100K), and performs similarly on natural images benchmarks (AWA2, CUB). For TT100K and MTSD, our approach is able to detect novel samples at the correct nodes of the hierarchy with 81% and 36% of accuracy, respectively, at 80% known class accuracy. [ABSTRACT FROM AUTHOR]

Ridges and valleys are useful geometric features for image analysis. Different characterizations have been proposed to formalize the intuitive notion of ridge/valley. In this paper, we review their principal characterizations and propose a new one. Subsequently, we evaluate these characterizations with respect to a list of desirable properties and their purpose in the context of representative image analysis tasks. Index Terms - Creases, separatrices, drainage patterns, comparative analysis.

This work tackles the problem faced by network/infrastructure providers of jointly selecting routing and functional split level to satisfy requests from virtual mobile network operators (vMNOs). We build a novel system model that brings together all the involved elements and features, embracing split levels defined by the 3GPP and packet switch fronthaul network. To our best knowledge, this is the first work that provides a solution for multiple vMNO requests considering the two aforementioned sub-problems (i.e., split selection and routing). We use the model defined to formulate an optimization problem, which is characterized by the exponential size of its search space. We propose two heuristic approaches to address this problem: (1) a greedy scheme, and (2) an evolutionary algorithm, which is also improved with a specialized initialization. We conduct extensive experiments to assess the performance and behavior of the proposed methods, over varying network instances. When possible, we also perform comparisons with respect to the optimal solution and a well-known commercial solver. Our results indicate that the proposed techniques represent appropriate trade-offs between solution quality and execution time, and can serve complementary goals: the quality of the results yielded by our evolutionary method are better, but at the cost of longer execution times; in contrast, our greedy algorithm offers a reasonably appropriate performance, with an execution time that is notably lower. Our experiments show that it is possible to produce near-optimal results to the above complex problem through computationally efficient algorithmic solutions. [ABSTRACT FROM AUTHOR]

Telecommunication operators are increasingly integrating computational infrastructure into their networks at different location levels, including the network edge. This makes a highly distributed processing environment a reality, which is expected to enable next-generation services. This article proposes a novel and efficient algorithm to determine the best service execution locations through the “service edge,” a concept that groups services in categories according to their requirements and benefits from the flexibility of distributed cloud resources. The article is focused on describing the algorithm so that it can be integrated into the telco operators' management and orchestration systems. Simulation results underpin the practical feasibility of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Cloud-network slicing is a promising approach to serve vertical industries delivering their services over multiple administrative and technological domains. However, there are numerous open challenges to provide end-to-end slices due to complex business and engineering requirements from service and resource providers. This article presents a reference architecture for the cloud-network slicing concept and the practical realization of the slice-as-a-service paradigm, which are key results from the Novel Enablers in Cloud Slicing (NECOS) project. The NECOS platform has been designed to consider modularity, separation of concerns, and multi-domain dynamic operation as prime attributes. The architecture comprises a set of interworking components to automatically create, manage, and decommission end-to-end cloud-network slice instances in a lightweight manner. NECOS orchestrates slices at runtime, spanning across core/edge data centers and wired/wireless network infrastructures. The novelties of the multi-domain NECOS platform are validated through three proof-of-concept experiments: (i) a touristic content delivery service slice deployment featuring on-demand virtual infrastructure management across three countries on different continents to meet particular slice requirements; (ii) intelligent slice elasticity driven by machine learning techniques; and (iii) market-place-based resource discovery capabilities. [ABSTRACT FROM AUTHOR]

Network slicing has recently been proposed as one of the main enablers for 5G networks. The slicing concept consists of the partition of a physical network into several self-contained logical networks (slices) that can be tailored to offer different functional or performance requirements. In the context of 5G networks, we argue that existing ubiquitous WiFi technology can be exploited to cope with new requirements. Therefore, in this paper, we propose a novel mechanism to implement network slicing in WiFi Access Points. We formulate the resource allocation problem to the different slices as a stochastic optimization problem, where each slice can have bit rate, delay, and capacity requirements. We devise a solution to the problem above using the Lyapunov drift optimization theory, and we develop a novel queuing and scheduling algorithm. We have used MATLAB and Simulink to build a prototype of the proposed solution, whose performance has been evaluated in a typical slicing scenario. [ABSTRACT FROM AUTHOR]

In this work, we propose a novel intra-flow network coding solution, which is based on the combination of a low overhead Random Linear Coding (RLC) scheme and UDP, to offer a reliable communication service. In the initial protocol specification, the required overhead could be rather large and this had an impact over the observed performance. We therefore include an improvement to reduce such overhead, by decreasing the header length. We describe an analytical model that can be used to assess the performance of the proposed scheme. We also use an implementation within the ns-3 framework to assess the correctness of this model and to broaden the analysis, considering different performance indicators and more complex network topologies. In all cases, the proposed solution clearly outperforms a more traditional approach, in which the TCP protocol is used as a means to offer a reliable communication service. [ABSTRACT FROM AUTHOR]

Network function virtualization (NFV) and software defined networking (SDN) have been proposed to increase the cost-efficiency, flexibility, and innovation in network service provisioning. This is achieved by leveraging IT virtualization techniques and combining them with programmable networks. By doing so, NFV and SDN are able to decouple the network functionality from the physical devices on which they are deployed. Service function chains (SFCs) composed out of virtual network functions (VNFs) can now be deployed on top of the virtualized infrastructure to create new value-added services. Current NFV approaches are limited to mapping the different VNF to the physical substrate subject to resource capacity constraints. They do not provide the possibility to define location requirements with a certain granularity and constraints on the colocation of VNF and virtual edges. Nevertheless, many scenarios can be envisioned in which a service provider (SP) would like to attach placement constraints for efficiency, resilience, legislative, privacy, and economic reasons. Therefore, we propose a set of affinity and anti-affinity constraints, which can be used by SP to define such placement restrictions. Furthermore, a semantic SFC validation framework is proposed that allows the virtual network function infrastructure provider (VNFInP) to check the validity of a set of constraints and provide feedback to the SPs. This allows the VNFInP to filter out any non-valid SFC requests before sending them to the mapping algorithm, significantly reducing the mapping time. [ABSTRACT FROM PUBLISHER]

A service function chain (SFC) is an ordered combination of abstract network functions (eg, network address translation and a firewall) that together define a network service (eg, video on demand). In an SDN/NFV-based architecture, SFCs are composed of virtual network functions that need to be mapped to physical network components. Because the mapping of an SFC may be possible by multiple competing infrastructure providers (InPs), price will be a key differentiating factor. The pricing algorithm is therefore essential towards revenue management, yet current static pricing approaches suffer from several limitations. Among others, they do not consider the characteristics of the requests or the current state of the physical network. Using historical data, market data, and the current state of the physical network we investigate whether it is possible to increase total revenue of an InP compared to traditional static pricing approaches. This paper proposes a dynamic pricing algorithm to determine (1) at which utilization level it is rewarding to charge a higher price for a particular resource and (2) the alternative price that should be charged. Our simulation results for 8 different setups show that the proposed heuristic outperforms a static pricing approach significantly (by 8-85% points for the considered scenarios). As a consequence, the proposed approach can be considered as an alternative for static pricing approaches. Still, it is unclear how the total revenue of an InP is affected when multiple or all competitors use a dynamic pricing algorithm; this will therefore remain the focus of future work. [ABSTRACT FROM AUTHOR]

New architectural and design approaches for radio access networks have appeared with the introduction of network virtualization in the wireless domain. One of these approaches splits the wireless network infrastructure into isolated virtual slices under their own management, requirements, and characteristics. Despite the advances in wireless virtualization, there are still many open issues regarding the resource allocation and isolation of wireless slices. Because of the dynamics and shared nature of the wireless medium, guaranteeing that the traffic on one slice will not affect the traffic on the others has proven to be difficult. In this paper, we focus on the detailed definition of the problem, discussing its challenges. We also provide a review of existing works that deal with the problem, analyzing how new trends such as software defined networking and network function virtualization can assist in the slicing. We will finally describe some research challenges on this topic. [ABSTRACT FROM PUBLISHER]

Copyright of Historia y Politica: Ideas, Procesos y Movimientos Sociales is the property of Departamento De Historia del Pensamiento y de los Moviemientos Sociales y Politicos (Madrid) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Despite all the significant advances in pedestrian detection brought by computer vision for driving assistance, it is still a challenging problem. One reason is the extremely varying lighting conditions under which such a detector should operate, namely day and nighttime. Recent research has shown that the combination of visible and non-visible imaging modalities may increase detection accuracy, where the infrared spectrum plays a critical role. The goal of this paper is to assess the accuracy gain of different pedestrian models (holistic, part-based, patch-based) when training with images in the far infrared spectrum. Specifically, we want to compare detection accuracy on test images recorded at day and nighttime if trained (and tested) using (a) plain color images; (b) just infrared images; and (c) both of them. In order to obtain results for the last item, we propose an early fusion approach to combine features from both modalities. We base the evaluation on a new dataset that we have built for this purpose as well as on the publicly available KAIST multispectral dataset. [ABSTRACT FROM AUTHOR]

NFV continues to draw immense attention from researchers in both industry and academia. By decoupling NFs from the physical equipment on which they run, NFV promises to reduce CAPEX and OPEX, make networks more scalable and flexible, and lead to increased service agility. However, despite the unprecedented interest it has gained, there are still obstacles that must be overcome before NFV can advance to reality in industrial deployments, let alone delivering on the anticipated gains. While doing so, important challenges associated with network and function MANO need to be addressed. In this article, we introduce NFV and give an overview of the MANO framework that has been proposed by ETSI. We then present representative projects and vendor products that focus on MANO, and discuss their features and relationship with the framework. Finally, we identify open MANO challenges as well as opportunities for future research. [ABSTRACT FROM PUBLISHER]

As the virtualization of networks continues to attract attention from both industry and academia, the virtual network embedding (VNE) problem remains a focus of researchers. This paper proposes a one-shot, unsplittable flow VNE solution based on column generation. We start by formulating the problem as a path-based mathematical program called the primal, for which we derive the corresponding dual problem. We then propose an initial solution which is used, first, by the dual problem and then by the primal problem to obtain a final solution. Unlike most approaches, our focus is not only on embedding accuracy but also on the scalability of the solution. In particular, the one-shot nature of our formulation ensures embedding accuracy, while the use of column generation is aimed at enhancing the computation time to make the approach more scalable. In order to assess the performance of the proposed solution, we compare it against four state of the art approaches as well as the optimal link-based formulation of the one-shot embedding problem. Experiments on a large mix of virtual network (VN) requests show that our solution is near optimal (achieving about 95% of the acceptance ratio of the optimal solution), with a clear improvement over existing approaches in terms of VN acceptance ratio and average substrate network (SN) resource utilization, and a considerable improvement (92% for a SN of 50 nodes) in time complexity compared to the optimal solution. [ABSTRACT FROM PUBLISHER]

A new era in telecommunications is emerging. Virtualized networking functions and resources will offer network operators a way to shift the balance of expenditure from capital to operational, opening up networks to new and innovative services. This article introduces the concept of edge as a service (EaaS), a means of harnessing the flexibility of virtualized network functions and resources to enable network operators to break the tightly coupled relationship they have with their infrastructure and enable more effective ways of generating revenue. To achieve this vision, we envisage a virtualized service access interface that can be used to programmatically alter access network functions and resources available to service providers in an elastic fashion. EaaS has many technically and economically difficult challenges that must be addressed before it can become a reality; the main challenges are summarized in this article. [ABSTRACT FROM AUTHOR]

Video alignment is important in different areas of computer vision such as wide baseline matching, action recognition, change detection, video copy detection and frame dropping prevention. Current video alignment methods usually deal with a relatively simple case of fixed or rigidly attached cameras or simultaneous acquisition. Therefore, in this paper we propose a joint video alignment for bringing two video sequences into a spatio-temporal alignment. Specifically, the novelty of the paper is to formulate the video alignment to fold the spatial and temporal alignment into a single alignment framework. This simultaneously satisfies a frame-correspondence and frame-alignment similarity; exploiting the knowledge among neighbor frames by a standard pairwise Markov random field (MRF). This new formulation is able to handle the alignment of sequences recorded at different times by independent moving cameras that follows a similar trajectory, and also generalizes the particular cases that of fixed geometric transformation and/or linear temporal mapping. We conduct experiments on different scenarios such as sequences recorded simultaneously or by moving cameras to validate the robustness of the proposed approach. The proposed method provides the highest video alignment accuracy compared to the state-of-the-art methods on sequences recorded from vehicles driving along the same track at different times. [ABSTRACT FROM PUBLISHER]

This paper presents a graduate course project on computer vision. The aim of the project is to detect and recognize traffic signs in video sequences recorded by an on-board vehicle camera. This is a demanding problem, given that traffic sign recognition is one of the most challenging problems for driving assistance systems. Equally, it is motivating for the students given that it is a real-life problem. Furthermore, it gives them the opportunity to appreciate the difficulty of real-world vision problems and to assess the extent to which this problem can be solved by modern computer vision and pattern classification techniques taught in the classroom. The learning objectives of the course are introduced, as are the constraints imposed on its design, such as the diversity of students' background and the amount of time they and their instructors dedicate to the course. The paper also describes the course contents, schedule, and how the project-based learning approach is applied. The outcomes of the course are discussed, including both the students' marks and their personal feedback. [ABSTRACT FROM AUTHOR]

In recent years, various network virtualization techniques have been proposed for flexibly supporting heterogeneous services over virtual network platforms. However, systematic views on how virtual network resources (VNRs) can be practically managed in such open environments has been missing till now. To fill the gap, we present in this article a two-dimensional architecture for end-to-end VNR management from distinct viewpoints of service providers and network providers. The horizontal dimension of VNR management allows SPs to bind VNRs rented from heterogeneous NPs to form unified end-to-end service delivery platforms. The vertical dimension of VNR management enables NPs to perform cost-efficient allocation of VNRs to requesting SPs, but without necessarily forcing themselves to collaborate with each other. Such a VNR management architecture will complement existing network virtualization platforms in accelerating the realization of virtual resource sharing in the future Internet business marketplaces. [ABSTRACT FROM PUBLISHER]

Intelligent vehicle lighting systems aim at automatically regulating the headlights' beam to illuminate as much of the road ahead as possible while avoiding dazzling other drivers. A key component of such a system is computer vision software that is able to distinguish blobs due to vehicles' headlights and rear lights from those due to road lamps and reflective elements such as poles and traffic signs. In a previous work, we have devised a set of specialized supervised classifiers to make such decisions based on blob features related to its intensity and shape. Despite the overall good performance, there remain challenging that have yet to be solved: notably, faint and tiny blobs corresponding to quite distant vehicles. In fact, for such distant blobs, classification decisions can be taken after observing them during a few frames. Hence, incorporating tracking could improve the overall lighting system performance by enforcing the temporal consistency of the classifier decision. Accordingly, this paper focuses on the problem of constructing blob tracks, which is actually one of multiple-target tracking (MTT), but under two special conditions: We have to deal with frequent occlusions, as well as blob splits and merges. We approach it in a novel way by formulating the problem as a maximum a posteriori inference on a Markov random field. The qualitative (in video form) and quantitative evaluation of our new MTT method shows good tracking results. In addition, we will also see that the classification performance of the problematic blobs improves due to the proposed MTT algorithm. [ABSTRACT FROM PUBLISHER]

In this paper we present a computer vision system for daytime vehicle detection and localization, an essential step in the development of several types of advanced driver assistance systems. It has a reduced processing time and high accuracy thanks to the combination of vehicle detection with lane-markings estimation and temporal tracking of both vehicles and lane markings. Concerning vehicle detection, our main contribution is a frame scanning process that inspects images according to the geometry of image formation, and with an Adaboost-based detector that is robust to the variability in the different vehicle types (car, van, truck) and lighting conditions. In addition, we propose a new method to estimate the most likely three-dimensional locations of vehicles on the road ahead. With regards to the lane-markings estimation component, we have two main contributions. First, we employ a different image feature to the other commonly used edges: we use ridges, which are better suited to this problem. Second, we adapt RANSAC, a generic robust estimation method, to fit a parametric model of a pair of lane markings to the image features. We qualitatively assess our vehicle detection system in sequences captured on several road types and under very different lighting conditions. The processed videos are available on a web page associated with this paper. A quantitative evaluation of the system has shown quite accurate results (a low number of false positives and negatives) at a reasonable computation time. [ABSTRACT FROM AUTHOR]

In this work, we address the problem of aligning two video sequences. Such alignment refers to synchronization, i.e., the establishment of temporal correspondence between frames of the first and second video, followed by spatial registration of all the temporally corresponding frames. Video synchronization and alignment have been attempted before, but most often in the relatively simple cases of fixed or rigidly attached cameras and simultaneous acquisition. In addition, restrictive assumptions have been applied, including linear time correspondence or the knowledge of the complete trajectories of corresponding scene points; to some extent, these assumptions limit the practical applicability of any solutions developed. We intend to solve the more general problem of aligning video sequences recorded by independently moving cameras that follow similar trajectories, based only on the fusion of image intensity and GPS information. The novelty of our approach is to pose the synchronization as a MAP inference problem on a Bayesian network including the observations from these two sensor types, which have been proved complementary. Alignment results are presented in the context of videos recorded from vehicles driving along the same track at different times, for different road types. In addition, we explore two applications of the proposed video alignment method, both based on change detection between aligned videos. One is the detection of vehicles, which could be of use in ADAS. The other is online difference spotting videos of surveillance rounds. [ABSTRACT FROM AUTHOR]

Individual wireless access networks show limitations that can be overcome through the integration of different technologies into a unified platform [i.e., fourth-generation (4G) system]. Nevertheless, the integration of heterogeneous networks poses many challenges such as adding complexity to the processes of deciding when to handoff, selecting the best network, and minimizing roaming effects using appropriate handover methods. This paper presents PROTON, a novel solution that supports decision-making processes related to roaming between heterogeneous technologies. PROTON deploys a formal policy representation model, based on finite-state transducers, that evaluates policies using information from the context to manage mobiles' behavior in a transparent manner, hiding 4G systems' complexities. We blend concepts of autonomic computing into the design of the solution and manage to improve user experience in typical 4G scenarios, while keeping transparency. [ABSTRACT FROM AUTHOR]