Past and present distribution, densities and movements of blue whales Balaenoptera musculus in the Southern Hemisphere and northern Indian Ocean

1. Blue whale locations in the Southern Hemisphere and northern Indian Ocean were obtained from catches (303 239), sightings (4383 records of ≥ 8058 whales), strandings (103), Discovery marks (2191) and recoveries (95), and acoustic recordings. 2. Sighting surveys included 7 480 450 km of effort plus 14 676 days with unmeasured effort. Groups usually consisted of solitary whales (65.2%) or pairs (24.6%); larger feeding aggregations of unassociated individuals were only rarely observed. Sighting rates (groups per 1000 km from many platform types) varied by four orders of magnitude and were lowest in the waters of Brazil, South Africa, the eastern tropical Pacific, Antarctica and South Georgia; higher in the Subantarctic and Peru; and highest around Indonesia, Sri Lanka, Chile, southern Australia and south of Madagascar. 3. Blue whales avoid the oligotrophic central gyres of the Indian, Pacific and Atlantic Oceans, but are more common where phytoplankton densities are high, and where there are dynamic oceanographic processes like upwelling and frontal meandering. 4. Compared with historical catches, the Antarctic (‘true’) subspecies is exceedingly rare and usually concentrated closer to the summer pack ice. In summer they are found throughout the Antarctic; in winter they migrate to southern Africa (although recent sightings there are rare) and to other northerly locations (based on acoustics), although some overwinter in the Antarctic. 5. Pygmy blue whales are found around the Indian Ocean and from southern Australia to New Zealand. At least four groupings are evident: northern Indian Ocean, from Madagascar to the Subantarctic, Indonesia to western and southern Australia, and from New Zealand northwards to the equator. Sighting rates are typically much higher than for Antarctic blue whales.

A New Cryptographic Scheme for Securing Dynamic Conferences in Data Networks

Dynamic conferencing refers to a scenario wherein any subset of users in a universe of users form a conference for sharing confidential information among themselves. The key distribution (KD) problem in dynamic conferencing is to compute a shared secret key for such a dynamically formed conference. In literature, the KD schemes for dynamic conferencing either are computationally unscalable or require communication among users, which is undesirable. The extended symmetric polynomial based dynamic conferencing scheme (ESPDCS) is one such KD scheme which has a high computational complexity that is universe size dependent. In this paper we present an enhancement to the ESPDCS scheme to develop a KD scheme called universe-independent SPDCS (UI-SPDCS) such that its complexity is independent of the universe size. However, the UI-SPDCS scheme does not scale with the conference size. We propose a relatively scalable KD scheme termed as DH-SPDCS that uses the UI-SPDCS scheme and the tree-based group Diffie- Hellman (TGDH) key exchange protocol. The proposed DH-SPDCS scheme provides a configurable trade-off between computation and communication complexity of the scheme.

Dynamic Routing in Translucent WDM Optical Networks

Translucent WDM optical networks use sparse placement of regenerators to overcome the impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks with much less cost. Our previous study proved the feasibility of translucent networks using sparse regeneration technique. We addressed the placement of regenerators based on static schemes allowing only fixed number of regenerators at fixed locations. This paper furthers the study by proposing a suite of dynamical routing schemes. Dynamic allocation, advertisement and discovery of regeneration resources are proposed to support sharing transmitters and receivers between regeneration and access functions. This study follows the current trend in optical networking industry by utilizing extension of IP control protocols. Dynamic routing algorithms, aware of current regeneration resources and link states, are designed to smartly route the connection requests under quality constraints. A hierarchical network model, supported by the MPLS-based control plane, is also proposed to provide scalability. Experiments show that network performance is improved without placement of extra regenerators.