Search results for "distributed"
showing 10 items of 1260 documents
A Smart Contract Based Recommender System
2019
Nowadays information available on the World Wide Web has reached unprecedented growth and it makes difficult for users to find the most relevant for them. In order to alleviate such issue, Recommender Systems (RSs) have been proposed to collect opinions and preferences about a set of items, process such preferences and build a personalized information access. While the most part of current RSs exploit centralized architecture to provide the service, in this manuscript we propose an alternative approach for building a general purpose RSs that provides to users with more transparent and decentralized rating strategy. Indeed, the proposed framework is built on top of a Distributed Ledger techn…
Cimo: An efficient 2-phases calculator of multimodal itineraries for real trans-territories based on a dynamic programming
2015
In this work we propose an exact solution for calculating multimodal itinerary. This solution is named Cimo (Calculateur d'Itineraires Multimodaux Ordonnes). Cimo is an exact optimal itineraries' calculator wherein itineraries are sorted, multimodal, and trans-territorial. The solution is based on a dynamic programming algorithm "cut", "price" and "share". This solution is multi-objectives and multi-constraints. Several versions of this algorithm are proposed following a methodological approach that enables evaluation of efficiency and complexity's gain : through theoretical calculus and benchmarks. In the first version of realistic problem, we propose a solution with itineraries calculated…
Retrieving Monitoring and Accounting Information from Constrained Devices in Internet-of-Things Applications
2013
Part 6: Monitoring Mechanisms; International audience; Internet-of-Things (IoT) is envisioned to provide connectivity to a vast number of sensing or actuating devices with limited computational and communication capabilities. For the organizations that manage these constrained devices, the monitoring of each device’s operational status and performance level as well as the accounting of their resource usage are of great importance. However, monitoring and accounting support is lacking in today’s IoT platforms. Hence, this paper studies the applicability of the Constrained Application Protocol (CoAP), a lightweight transfer protocol under development by IETF, for efficiently retrieving monito…
"Table 5" of "Search for heavy charged long-lived particles in the ATLAS detector in 31.6 fb$^{-1}$ of proton-proton collision data at $\sqrt{s} = 13…
2019
Expected signal yield and acceptance x efficiency, estimated background and observed number of events in data for the full range of simulated masses in the full-detector R-hadron search.
"Table 5" of "Search for heavy charged long-lived particles in the ATLAS detector in 31.6 fb$^{-1}$ of proton-proton collision data at $\sqrt{s} = 13…
2019
Expected signal yield and acceptance x efficiency, estimated background and observed number of events in data for the full range of simulated masses in the full-detector R-hadron search.
"Table 20" of "Measurement of event shape and inclusive distributions at s**(1/2) = 130-GeV and 136-GeV."
1997
3-jet rate for the Durham Algorithm.
Designing the 5G network infrastructure: a flexible and reconfigurable architecture based on context and content information
2018
5G networks will have to offer extremely high volumes of content, compared to those of today’s. Moreover, they will have to support heterogeneous traffics, including machine-to-machine, generated by a massive volume of Internet-of-Things devices. Traffic demands will be variable in time and space. In this work, we argue that all this can be achieved in a cost-effective way if the network is flexible and reconfigurable. We present the Flex5Gware network architecture, designed to meet the above requirements. Moreover, we discuss the links between flexibility and reconfigurability, on the one side, and context awareness and content awareness, on the other; we show how two of the building…
Distributed radio map reconstruction for 5G automotive
2018
Se espera que los mapas de entorno radio sean una herramienta esencial para la optimización y gestión de recursos del 5G en vehículos. En este trabajo, consideramos el problema de la reconstrucción del mapa de entorno radio utilizando una red de sensores inalámbricos formada por nodos sensores en vehículos, nodos de acceso de una infraestructura de ciudad inteligente, etc. Debido a las limitaciones de recursos en las redes de sensores, es crucial seleccionar un pequeño número de mediciones de los sensores para reconstruir el campo. En este contexto, presentamos un novedoso algoritmo distribuido basado en el método de regresión Kriging para la reconstrucción del mapa de entorno radio en térm…
A low complexity distributed cluster based algorithm for spatial prediction
2017
Los mapas del entorno radioeléctrico (REM) pueden ser una herramienta esencial para numerosas aplicaciones en las futuras redes inalámbricas 5G. En este trabajo, empleamos un popular método geoestadístico llamado kriging ordinario para estimar el REM de un área cubierta por un eNodeB equipado con múltiples antenas. Los sensores inalámbricos se distribuyen por el área de interés y se organizan clústeres adaptativos de sensores para mejorar la calidad de la estimación del canal. En este trabajo, modificamos el algoritmo de clustering distribuido propuesto en un trabajo anterior para reducir la complejidad de la predicción de kriging. Se realizan simulaciones para detallar la técnica de formac…
Distributed channel prediction for multi-agent systems
2017
Los sistemas multiagente (MAS) se comunican a través de una red inalámbrica para coordinar sus acciones e informar sobre el estado de su misión. La conectividad y el rendimiento del sistema pueden mejorarse mediante la predicción de la ganancia del canal. Presentamos un esquema basado en regresión de procesos gaussianos (GPR) distribuidos para predecir el canal inalámbrico en términos de la potencia recibida en el MAS. El esquema combina una máquina de comité bayesiano con un esquema de consenso medio, distribuyendo así no sólo la memoria sino también la carga computacional y de comunicación. A través de simulaciones de Monte Carlo, demostramos el rendimiento del GPR propuesto. RACHEL TEC20…