177,868 research outputs found
Low-Power Wide-Area Networks in Intelligent Transportation: Review and Opportunities for Smart-Railways
No full textThe aim of this paper is to provide an overview of the state-of-the-art in LPWAN, with a focus on intelligent transportation. IoT and LPWAN technologies appear as very promising for cost-effective remote surveillance, monitoring and control over large geographical areas, by collecting data for several sensing applications (e.g., predictive condition-based maintenance, security early warning and situation awareness, etc.) even in situations where power supply is limited (e.g., solar panels) or absent (e.g., installation on-board freight cars).
R. Dirnfeld, F. Flammini, S. Marrone, R. Nardone and V. Vittorini, "Low-Power Wide-Area Networks in Intelligent Transportation: Review and Opportunities for Smart-Railways," 2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC), 2020, pp. 1-7,
doi: 10.1109/ITSC45102.2020.9294535
L'Epitaphium Senecae (667 R.) nella tradizione del genere epigrammatico, in Trasmissione e Ricezione del testo di Seneca.
No full textMultidimensional interval routing schemes
No full textInterval routing scheme (k-IRS) is a compact routing scheme on general networks. It has been studied extensively and recently been implemented on the latest generation INMOS Transputer Router chip. In this paper we introduce an extension of the Interval Routing Scheme k-IRS to the multidimensional case [k,d]-MIRS, where k is the number of intervals and d is the number of dimensions. Whereas R-IRS only represents compactly a single shortest path between any two nodes, with this new extension we are able to represent all shortest paths compactly. This is useful for fault-tolerance and traffic distribution in a network. We study efficient representations of all shortest paths between any pair of nodes for general network topologies, for product graphs and for specific interconnection networks such as rings, grids, tori, hypercubes and chordal rings. For these interconnection networks we show that for about the same space complexity as K-IRS we can represent all shortest paths in [k,d]-MIRS las compared to only a single shortest path in K-IRS), Moreover, trade-offs are derived between the dimension d and the number of intervals k in multidimensional interval routing schemes on hypercubes, grids and tori. (C) 1998-Elsevier Science B.V. All rights reserved
Angular structure of lacunarity, and the renormalization group
No full textWe formulate the angular structure of lacunarity in fractals, in terms of a symmetry reduction of the three point correlation function. This provides a rich probe of universality, and first measurements yield new evidence in support of the equivalence between self-avoiding walks (SAW’s) and percolation perimeters in two dimensions. We argue that the lacunarity reveals much of the renormalization group in real space. This is supported by exact calculations for random walks and measured data for percolation clusters and SAW’s. Relationships follow between exponents governing inward and outward propagating perturbations, and we also find a very general test for the contribution of long-range interactions. © 2000 The American Physical Society
- …
