In a cross, multi-system world, blockchain technology is rapidly used to facilitate transaction security and safety, supply - Chain, cryptographic protocols, and identity authentication. This facilitation occurs becau...
详细信息
The access control state of a system is complex, and Machine Learning (ML) based access control decision engines have demonstrated advantages of policies. However, struggle to effectively implement Role-Based Access C...
详细信息
The integration of diverse infrastructures in modern-day power systems facilitates unauthorized access and data manipulation by adversaries, as these systems heavily rely on Information and Communication Technology (I...
详细信息
In the area of development of AI/ML applications in Vehicular Adhoc networks (VANET), a highly dynamic environment, efficient algebraic distributed computations are of utmost importance. On the other hand, there is a ...
详细信息
ISBN:
(数字)9783031673214
ISBN:
(纸本)9783031673207;9783031673214
In the area of development of AI/ML applications in Vehicular Adhoc networks (VANET), a highly dynamic environment, efficient algebraic distributed computations are of utmost importance. On the other hand, there is a growing concern about privacy of users/drivers. One of the solutions is to perform computations assuming anonymity of the users. There is already a large amount of work on this topic in the general Anonymous Dynamic Network model, however the obtained theoretical guarantees are not suitable for very large-scale networks, such as VANET. In this work, we propose an anonymous algebraic computation framework tailored for VANET, called Anonymous Vehicular Adhoc networks (A-VANET). We introduce heuristic changes to the Restricted Methodical Counting (RMC) protocol aiming to speed up performance in A-VANET with respect to the theoretical bounds in general Anonymous Dynamic networks. We evaluate this protocol on traces of taxi trips in New York City extracted from publicly available data from 2013, and on a highway traffic environment modeled by a set of path graphs. Both inputs are highly dynamic including also recurrent disconnections. Our results show that, for the parameter combinations tested and for networks with good expansion, RMC is sub-quadratic and even linear under some conditions. Therefore, even the theoretical upper bound proved as a function of connectivity parameters is loose by a factor of more than n7. These results show the promise of further exploring the question of what is the optimal running time for algebraic computations in A-VANET and other practically-motivated Anonymous Dynamic networks with limited messages, memory and disconnections.
The proceedings contain 72 papers. The topics discussed include: online domain adaptive classification for mobile-to-edge computing;information flow graph for distributed caching without newcomers over a broadcast med...
ISBN:
(纸本)9798350331653
The proceedings contain 72 papers. The topics discussed include: online domain adaptive classification for mobile-to-edge computing;information flow graph for distributed caching without newcomers over a broadcast medium;ARLCL: anchor-free ranging-likelihood-based cooperative localization;a picture is worth 1,000 millimeters: combining vision and Wi-Fi to improve localization;equalizing access to latency-critical services based on in-network computing;handling demand heterogeneity in UAV-aided content caching in communication-challenged environments;gesture recognition with mmWave Wi-Fi access points: lessons learned;disaggregated mobile core for edge city services;and admission control with latency considerations for 5G mobile edge computing.
Optimal actuator and control design is studied as a multi-level optimisation problem, where the actuator design is evaluated based on the performance of the associated optimal closed loop. The evaluation of the optima...
详细信息
Optimal actuator and control design is studied as a multi-level optimisation problem, where the actuator design is evaluated based on the performance of the associated optimal closed loop. The evaluation of the optimal closed loop for a given actuator realisation is a computationally demanding task, for which the use of a neural network surrogate is proposed. The use of neural network surrogates to replace the lower level of the optimisation hierarchy enables the use of fast gradient-based and gradient-free consensus-based optimisation methods to determine the optimal actuator design. The effectiveness of the proposed surrogate models and optimisation methods is assessed in a test related to optimal actuator location for heat control. Copyright (c) 2024 The Authors. This is an open access article under the CC BY-NC-ND license (https://***/licenses/by-nc-nd/4.0/)
Recently, India overtook China to become the world's most populous country. A larger part of the Indian population living in small to medium and large towns and cities have been facing serious problems of traffic ...
详细信息
ISBN:
(纸本)9798350320107
Recently, India overtook China to become the world's most populous country. A larger part of the Indian population living in small to medium and large towns and cities have been facing serious problems of traffic congestion and vehicular transportation in urban areas. Consequently, urban road and street networks have occupied a core position in the functioning of cities. Therefore, assessment of the topological patterns of road infrastructure is crucial for improving the performance of transportation since the spatial pattern of the current road networks have greatly impacted the urban mobility. This paper attempts to analyze the topological patterns of road networks of small and medium-sized Indian cities in terms of connectivity and coverage measures using graph theory. Cities have been prioritized with respect to population ranging from 20,000 to 0.5 million. As a result, 505 such cities were selected in this study. The road maps of individual cities were split into lines at intersections, which were then converted to network with attribute parameters such as number of edges and vertices, and were subsequently used to compute topological (connectivity and coverage) measures such as Alpha, Beta, Gamma, Grid Tree Pattern (GTP), Eta indices, Network Density (ND), Edge Graph Density (EGD) and Nodal Graph Density (NGD). The study revealed that on an average, only 41% of the small and medium-sized Indian cities have greater connectivity (for example, Alpha > 0.8) and only 5% cities have network density higher than 5 km. This indicates that the road and street networks are not distributed evenly throughout the Indian cities. Furthermore, smaller cities that are located close to/near large metropolitan cities have higher connectivity and coverage, whereas smaller cities placed far away from metropolitan areas have less development in the road transportation systems.
Pancreatic cancer poses a significant challenge in early detection and treatment due to its malignant nature within the digestive tract. Recent studies, such as those conducted by the Pancreatic Cancer Action Network,...
详细信息
In recent time the number of people dying and suffering from heart disease is very high also these cases are increasing day by day. In heart disease the diagnosis at early phase is very crucial. Machine learning can h...
详细信息
In recent years, the rapid development of drones has brought tremendous changes to many fields. From refined management in agriculture and forestry to aerial surveying in urban planning, the popularity of UAVs provide...
详细信息
暂无评论