Variation in the distribution of walleye pollock (Theragra chalcogramma) with temperature and implications for seasonal migration

Aspects of the feeding migration of walleye pollock (Theragra chalcogramma) in the eastern Bering Sea (EBS) were investigated by examining the relationship between temperatures and densities of fish encountered during acoustic and bottom trawl surveys conducted in spring and summer between 1982 and 2001. Bottom temperature was used as an indicator of spring and summer warming of the EBS. Clusters of survey stations were identified where the density of walleye pollock generally increased or decreased with increasing water temperature. Inferences about the direction and magnitude of the spring and summer feeding migration were made for five length categories of walleye pollock. Generally, feeding migrations appeared to be northward and shoreward, and the magnitude of this migration appeared to increase with walleye pollock size up to 50 cm. Pollock larger then 50 cm showed limited migratory behavior. Pollock may benefit from northward feeding migrations because of the changes in temperature, zooplankton production, and light conditions. Ongoing climate changes may affect pollock distribution and create new challenges for pollock management in the EBS.

Life history characteristics for silvergray rockfish (Sebastes brevispinis) in British Columbia waters and the implications for stock assessment and management

We summarize the life history characteristics of silvergray rockfish (Sebastes brevispinis) based on commercial fishery data and biological samples from British Columbia waters. Silvergray rockfish occupy bottom depths of 100−300 m near the edge of the continental shelf. Within that range, they appear to make a seasonal movement from 100−200 m in late summer to 180−280 m in late winter. Maximum observed age in the data set was 81 and 82 years for females and males, respectively. Maximum length and round weight was 73 cm and 5032 g for females and 70 cm and 3430 g for males. The peak period of mating lasted from December to February and parturition was concentrated from May to July. Both sexes are 50% mature by 9 or 10 years and 90% are mature by age 16 for females and age 13 years for males. Fecundity was estimated from one sample of 132 females and ranged from 181,000 to 1,917,000 oocytes and there was no evidence of batch spawning. Infection by the copepod parasite Sarcotaces arcticus appears to be associated with lower fecundity. Sexual maturation appears to precede recruitment to the trawl fishery; thus spawning stock biomass per recruit analysis (SSB/R) indicates that a F50% harvest target would correspond to an F of 0.072, 20% greater than M (0.06). Fishery samples may bias estimates of age at maturity but a published meta-data analysis, in conjunction with fecundity data, independently supports an early age of maturity in relation to recruitment. Although delayed recruitment to the fishery may provide more resilience to exploitation, managers may wish to forego maximizing economic yield from this species. Silvergray rockfish are a relatively minor but unavoidable part of the multiple species trawl catch. Incorrectly “testing” the resilience of one species may cause it to be the weakest member of the specie

Improving the consensus performance via predictive mechanisms

Considering some predictive mechanisms, we show that ultrafast average-consensus can be achieved in networks of interconnected agents. More specifically, by predicting the dynamics of the network several steps ahead and using this information in the design of the consensus protocol of each agent, drastic improvements can be achieved in terms of the speed of consensus convergence, without changing the topology of the network. Moreover, using these predictive mechanisms, the range of sampling periods leading to consensus convergence is greatly expanded compared with the routine consensus protocol. This study provides a mathematical basis for the idea that some predictive mechanisms exist in widely-spread biological swarms, flocks, and networks. From the industrial engineering point of view, inclusion of an efficient predictive mechanism allows for a significant increase in the speed of consensus convergence and also a reduction of the communication energy required to achieve a predefined consensus performance.

Global state synchronization in networks of cyclic feedback systems

This technical note studies global asymptotic state synchronization in networks of identical systems. Conditions on the coupling strength required for the synchronization of nodes having a cyclic feedback structure are deduced using incremental dissipativity theory. The method takes advantage of the incremental passivity properties of the constituent subsystems of the network nodes to reformulate the synchronization problem as one of achieving incremental passivity by coupling. The method can be used in the framework of contraction theory to constructively build a contracting metric for the incremental system. The result is illustrated for a network of biochemical oscillators. © 2011 IEEE.

Decentralised minimal-time consensus

This study considers the discrete-time dynamics of a network of agents that exchange information according to the nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the consensus value of the whole network in finite time using only the minimal number of successive values of its own history. We show that this minimal number of steps is related to a Jordan block decomposition of the network dynamics and present an algorithm to obtain the minimal number of steps in question by checking a rank condition on a Hankel matrix of the local observations. Furthermore, we prove that the minimal number of steps is related to other algebraic and graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the underlying graph topology. © 2011 IEEE.

Reconstruction of arbitrary biochemical reaction networks: A compressive sensing approach

Reconstruction of biochemical reaction networks (BRN) and genetic regulatory networks (GRN) in particular is a central topic in systems biology which raises crucial theoretical challenges in system identification. Nonlinear Ordinary Differential Equations (ODEs) that involve polynomial and rational functions are typically used to model biochemical reaction networks. Such nonlinear models make the problem of determining the connectivity of biochemical networks from time-series experimental data quite difficult. In this paper, we present a network reconstruction algorithm that can deal with ODE model descriptions containing polynomial and rational functions. Rather than identifying the parameters of linear or nonlinear ODEs characterised by pre-defined equation structures, our methodology allows us to determine the nonlinear ODEs structure together with their associated parameters. To solve the network reconstruction problem, we cast it as a compressive sensing (CS) problem and use sparse Bayesian learning (SBL) algorithms as a computationally efficient and robust way to obtain its solution. © 2012 IEEE.

Dynamical structure function identifiability conditions enabling signal structure reconstruction

Networks of controlled dynamical systems exhibit a variety of interconnection patterns that could be interpreted as the structure of the system. One such interpretation of system structure is a system's signal structure, characterized as the open-loop causal dependencies among manifest variables and represented by its dynamical structure function. Although this notion of structure is among the weakest available, previous work has shown that if no a priori structural information is known about the system, not even the Boolean structure of the dynamical structure function is identifiable. Consequently, one method previously suggested for obtaining the necessary a priori structural information is to leverage knowledge about target specificity of the controlled inputs. This work extends these results to demonstrate precisely the a priori structural information that is both necessary and sufficient to reconstruct the network from input-output data. This extension is important because it significantly broadens the applicability of the identifiability conditions, enabling the design of network reconstruction experiments that were previously impossible due to practical constraints on the types of actuation mechanisms available to the engineer or scientist. The work is motivated by the proteomics problem of reconstructing the Per-Arnt-Sim Kinase pathway used in the metabolism of sugars. © 2012 IEEE.

Decentralised minimum-time consensus

We consider the discrete-time dynamics of a network of agents that exchange information according to a nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the final consensus value of the whole network in finite time using the minimum number of successive values of its own state history. We show that the minimum number of steps is related to a Jordan block decomposition of the network dynamics, and present an algorithm to compute the final consensus value in the minimum number of steps by checking a rank condition of a Hankel matrix of local observations. Furthermore, we prove that the minimum number of steps is related to graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the minimum external equitable partition. © 2013 Elsevier Ltd. All rights reserved.

Analysis of interconnected oscillators by dissipativity theory

This paper employs dissipativity theory for the global analysis of limit cycles in particular dynamical systems of possibly high dimension. Oscillators are regarded as open systems that satisfy a particular dissipation inequality. It is shown that this characterization has implications for the global stability analysis of limit cycle oscillations: i) in isolated oscillators, ii) in interconnections of oscillators, and iii) for the global synchrony analysis in interconnections of identical oscillators. © 2007 IEEE.