The main results of this paper are (I) a simulation algorithm which, under quite general constraints, transforms algorithms running on the Congested Clique into algorithms running in the MapReduce model, and (II) a distributed O(∆)-coloring algorithm running on the Congested Clique which has an expected running time of O(1) rounds, if ∆ ≥ Θ(log n); and O(log log log n) rounds otherwise. Applyin...

These notes are dedicated to the analysis of one-dimensional free-congested Navier–Stokes equations. After a brief synthesis results obtained in Dalibard and Perrin (Commun Math Sci 18(7):1775–1813, 2020) related existence asymptotic stability partially congested profiles associated soft congestion Navier-Stokes system, we present first local well-posedness result for

Recently, according to growth and concentration of population in urban area, congested situations at several railway stations in rush hour become a serious social issue. Therefore, designing the station more comfortably for the passengers has been desired. In other words, in order to mitigate the congested situations, a method measuring crowds flow characteristics should be developed. In this p...

We consider a congested aggregation model that describes the evolution of a density through the competing effects of nonlocal Newtonian attraction and a hard height constraint. This provides a counterpoint to existing literature on repulsive-attractive nonlocal interaction models, where the repulsive effects instead arise from an interaction kernel or the addition of diffusion. We formulate our...

Recently, some methods of automated generation of schematic map are proposed. However, no specific method is given for expansion of congested area on a map in the process of schematization. In fact, it is a key to produce a schematic map with great clarity. For instance, for a line network map, if there are many lines in a small area on a map, although the shape of these lines is simplified by ...

Multipath transport protocols have the potential to greatly improve the performance and resilience of Internet traffic flows. The basic idea is that if flows are able to simultaneously use more than one path through the network, then they will be more resilient to problems on particular paths (e.g. transient problems on a radio interface), and they will be able to pool capacity across multiple ...

Consider a network facility location problem where congestion arises at facilities, and is represented by delay functions that approximate the queueing process. We strive to minimize the sum of customers' transportation and waiting times, and facilities' xed and variable costs. The problem is solved using a column generation technique within a Branch-and-Bound scheme. Numerical results are repo...

In this paper, we propose a network efficiency measure for congested networks, that captures demands, costs, flows, and behavior. The network efficiency/performance measure can identify which network components, that is, nodes and links, have the greatest impact in terms of their removal, due to, for example, natural disasters, structural failures, terrorist attacks, etc., and, hence, are impor...

Microstrip antennas are one of the most widely used types of antennas in the microwave frequency range, and they are often used in the millimeter-wave frequency range. Actually as the demand for high data rates grows and microwave frequency bands become congested, the millimeter-wave spectrum is becoming increasingly attractive for emerging wireless applications. The abundance of bandwidth and ...

Background The Current Landscape Recent generations of wireless systems have increased in flexibility and complexity. Techniques including frequency agility, multi-channel devices, and software-defined radios have all served to address the growing need for more wireless functionality, particularly in mobile devices. However, this has aggravated the long-existing problem in which the RF bandwidt...