In considering systems of distributed processes, we must deal with access to resources, locations and communication among processes. In this paper we present a new model for timed coordination of communicating distributed processes using an extension of the π-calculus with locations, types and timers. Types are used to express restricted access to distributed resources. Timers de ne timeouts fo...

Quantifying the performance of component-based or serviceoriented systems is a complex task, e.g., it is non-trivial to calculate the end-to-end quality of service of a composite Web service. An established approach to reason about such systems in general is the use of coordination models, which can provide a formal basis for both their verification and implementation. An example of such a mode...

Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However most of the proposed solutions require simultaneous relay transmissions at the same frequency bands, using distributed space-time coding algorithms. Careful design of distributed space-time coding for the relay channel, is usually bas...

Benefiting from the vigorous development of deep learning, many CNN-based image super-resolution methods have emerged and achieved better results than traditional algorithms. However, it is difficult for most algorithms to adaptively adjust spatial region channel features at same time, let alone information exchange between them. In addition, attention modules even less visible researchers. To ...

We show how an upstream …rm by using a price-dependent pro…tsharing rule can prevent destructive competition between downstream …rms that produce relatively close substitutes. With this rule the upstream …rm induces the retailers to behave as if demand has become less price elastic. As a result, competing downstream …rms will maximize aggregate total channel pro…t. When downstream …rms are bett...