User mobility in wireless data networks is increasing because of technological advances, and the desire for voice and multimedia applications. These applications, however, require handoffs between base stations to be fast to maintain the quality of the connections. Previous work on context transfer for fast handoffs has focused on reactive, i.e. the context transfer occurs after the mobile stat...

This paper introduces a mathematical model describing the energy and information systems for small satellite mission architectures. We introduce an analytic satellite model, represented by realistic constraints on the available energy, link characteristics, and data and energy storage capacity on-board a small spacecraft. This paper aims to identify the interaction of energy and information flo...

The issue addressed in this paper consists in the localization and dimensioning of transfer stations, which constitute a necessary intermediate level in the logistic chain of the solid waste stream, from municipalities to the incinerator. Contextually, the determination of the number and type of vehicles involved is carried out in an integrated optimization approach. The model considers both in...

This paper introduces a mathematical model describing the energy and information systems for small satellite mission architectures. We introduce an analytic satellite model, represented by realistic constraints on the available energy, link characteristics, and data and energy storage capacity on-board a small spacecraft. This paper aims to identify the interaction of energy and information flo...

The performance of various access control protocols for high-speed, bit-serial, computer communication rings is studied. Local Area Computer Network (LACN) applications in which message packets are of fixed length and shorter than the total inherent propagation delay around the ring are the focus of attention. Token, slotted, and static and dynamic insertion rings are included in the study. In ...

Transfer pattern routing is a state-of-the-art speed-up technique for finding optimal paths which minimize multiple cost criteria in public transportation networks. It precomputes sequences of transfer stations along optimal paths. At query time, the optimal paths are searched among the stored transfer patterns, which allows for very fast response times even on very large networks. On the other...