Generalized Fourier Integral Operators on spaces of Colombeau type

Generalized Fourier integral operators (FIOs) acting on Colombeau algebras are defined. This is based on a theory of generalized oscillatory integrals (OIs) whose phase functions as well as amplitudes may be generalized functions of Colombeau type. The mapping properties of these FIOs are studied as the composition with a generalized pseudodifferential operator. Finally, the microlocal Colombeau regularity for OIs and the influence of the FIO action on generalized wave front sets are investigated. This theory of generalized FIOs is motivated by the need of a general framework for partial differential operators with non-smooth coefficients and distributional data

Topological properties of regular generalized function algebras

We investigate density of various subalgebras of regular generalized functions in the special Colombeau algebra of generalized functions.Comment: 6 page

Classes of generalized functions with finite type regularities

We introduce and analyze spaces and algebras of generalized functions which correspond to Hölder, Zygmund, and Sobolev spaces of functions. The main scope of the paper is the characterization of the regularity of distributions that are embedded into the corresponding space or algebra of generalized functions with finite type regularities

Content-centric wireless networks with limited buffers: when mobility hurts

We analyze throughput–delay scaling laws of mobile ad hoc networks under a content-centric traffic scenario, where users are mainly interested in retrieving contents cached by other nodes. We assume limited buffer size available at each node and Zipf-like content popularity. We consider nodes uniformly visiting the network area according to a random-walk mobility model, whose flight size varies from the typical distance among the nodes (quasi-static case) up to the edge length of the network area (reshuffling mobility model). Our main findings are: 1) the best throughput–delay tradeoffs are achieved in the quasi-static case: increasing the mobility degree of nodes leads to worse and worse performance; ii) the best throughput–delay tradeoffs can be recovered by power control (i.e., by adapting the transmission range to the content) even in the complete reshuffling case

Route Stability in MANETs under the Random Direction Mobility Model

Abstract: A fundamental issue arising in mobile ad hoc networks (MANETs) is the selection of the optimal path between any two nodes. A method that has been advocated to improve routing efficiency is to select the most stable path so as to reduce the latency and the overhead due to route reconstruction. In this work, we study both the availability and the duration probability of a routing path that is subject to link failures caused by node mobility. In particular, we focus on the case where the network nodes move according to the Random Direction model, and we derive both exact and approximate (but simple) expressions of these probabilities. Through our results, we study the problem of selecting an optimal route in terms of path availability. Finally, we propose an approach to improve the efficiency of reactive routing protocols

Stochastic Analysis of Self-Sustainability in Peer-Assisted VoDSystems

Abstract—We consider a peer-assisted Video-on-demand system, in which video distribution is supported both by peers caching the whole video and by peers concurrently downloading it. We propose a stochastic fluid framework that allows to characterize the additional bandwidth requested from the servers to satisfy all users watching a given video. We obtain analytical upper bounds to the server bandwidth needed in the case in which users download the video content sequentially. We also present a methodology to obtain exact solutions for special cases of peer upload bandwidth distribution. Our bounds permit to tightly characterize the performance of peer-assisted VoD systems as the number of users increases, for both sequential and nonsequential delivery schemes. In particular, we rigorously prove that the simple sequential scheme is asymptotically optimal both in the bandwidth surplus and in the bandwidth deficit mode, and that peer-assisted systems become totally self-sustaining in the surplus mode as the number of users grows large. I

Experiment K-6-03. Gravity and skeletal growth, part 1. Part 2: Morphology and histochemistry of bone cells and vasculature of the tibia; Part 3: Nuclear volume analysis of osteoblast histogenesis in periodontal ligament cells; Part 4: Intervertebral disc swelling pressure associated with microgravity

Bone area, bone electrophysiology, bone vascularity, osteoblast morphology, and osteoblast histogenesis were studied in rats associated with Cosmos 1887. The results suggest that the synchronous animals were the only group with a significantly larger bone area than the basal group, that the bone electrical potential was more negative in flight than in the synchronous rats, that the endosteal osteoblasts from flight rats had greater numbers of transitional Golgi vesicles but no difference in the large Golgi saccules or the alkaline phosphatase activity, that the perioteal vasculature in the shaft of flight rats often showed very dense intraluminal deposits with adjacent degenerating osteocytes as well as lipid accumulations within the lumen of the vessels and sometimes degeneration of the vascular wall (this change was not present in the metaphyseal region of flight animals), and that the progenitor cells decreased in flight rats while the preosteoblasts increased compared to controls. Many of the results suggest that the animals were beginning to recover from the effects of spaceflight during the two day interval between landing and euthanasia; flight effects, such as the vascular changes, did not appear to recover

Peer-assisted VoD Systems: An Efficient Modeling Framework

We analyze a peer-assisted Video-on-Demand (VoD) system in which users contribute their upload bandwidth to the redistribution of a video that they are downloading or that they have cached locally. Our target is to characterize the additional bandwidth that servers must supply to immediately satisfy all requests to watch a given video. We develop an approximate fluid model to compute the required server bandwidth in the sequential delivery case, as well as in controlled nonsequential swarms. Our approach is able to capture several stochastic effects related to peer churn, upload bandwidth heterogeneity, and nonstationary traffic conditions, which have not been documented or analyzed before. Finally, we provide important hints for the design of efficient peer-assisted VoD systems under server capacity constraints