Water and Salt Transports in the Hengsha Channel of Changjiang Estuary

In a multilevel bifurcated estuary, the channels between the bifurcated branches play important roles in the exchanges of water and salt. In the Changjiang Estuary, the Hengsha Channel (HC) connects the North Channel (NC) and the North Passage (NP). In this paper, based on a two-way nesting unstructured quadrilateral grid, finite-differencing, three-dimensional estuarine and coastal ocean model, the tidal and seasonal variations in the water and salt transports in the HC were simulated, and their dynamic mechanism was analyzed. The residual water and salt transports in the HC both flow southward from the NC to the NP. In wet season, the residual water transport in the HC is 677 m3/s during neap tide and 245 m3/s during spring tide, and the residual salt transport is 0. In dry season, the residual water and salt transports in the HC are 1278 m3/s and 0.38 t/s during neap tide, respectively, and 1328 m3/s and 12.61 t/s during spring tide. Affected by the northerly wind and the southeastward baroclinic gradient force, the water and salt fluxes in dry season are much larger than those in wet season. The dynamic mechanism responsible for the water transport in the HC was numerically simulated and analyzed.

Microscopic dynamic mechanism of equilibration in crystals: one-dimensional model

The dynamics of free vibrations of a chain of atoms is investigated taking into account the retardation of interactions. It is shown that all oscillations of the circuit are damped. The dynamics of forced vibrations of this chain of atoms is investigated. It is shown that, regardless of the initial conditions, the system passes into a stationary state of dynamic equilibrium with an external field, which depends both on the properties of the system and on the parameters of the external field. A non-statistical dynamic mechanism of the process of irreversible establishment of the state of thermodynamic equilibrium in both many-body and few-body systems is proposed.

Microscopic Dynamic Mechanism of Irreversible Thermodynamic Equilibration of Crystals

The dynamics of free and forced vibrations of a chain of particles are investigated in a harmonic model taking into account the retardation of interactions between atoms. It is found that the retardation of interactions between particles leads to the non-existence of stationary free vibrations of the crystal lattice. It is shown that in the case of a stable lattice, forced vibrations, regardless of the initial conditions, pass into a stationary regime. A non-statistical dynamic mechanism of the irreversible thermodynamic equilibration is proposed.

Interactions between nascent proteins and the ribosome surface inhibit co-translational folding

Most proteins begin to fold during biosynthesis on the ribosome. It has been suggested that interactions between the emerging polypeptide and the ribosome surface might allow the ribosome itself to modulate co-translational folding. Here we combine protein engineering and NMR spectroscopy to characterize a series of interactions between the ribosome surface and unfolded nascent chains of the immunoglobulin-like FLN5 filamin domain. The strongest interactions are found for a C-terminal segment that is essential for folding, and we demonstrate quantitative agreement between the strength of this interaction and the energetics of the co-translational folding process itself. Mutations in this region that reduce the extent of binding result in a shift in the co-translational folding equilibrium towards the native state. Our results therefore demonstrate that a competition between folding and binding provides a simple, dynamic mechanism for the modulation of co-translational folding by the ribosome.

On the Futility of Dynamics in Robust Mechanism Design

We consider a principal who repeatedly interacts with a strategic agent holding private information. In each round, the agent observes an idiosyncratic shock drawn independently and identically from a distribution known to the agent but not to the principal. The utilities of the principal and the agent are determined by the values of the shock and outcomes that are chosen by the principal based on reports made by the agent. When the principal commits to a dynamic mechanism, the agent best-responds to maximize his aggregate utility over the whole time horizon. The principal’s goal is to design a dynamic mechanism to minimize his worst-case regret, that is, the largest difference possible between the aggregate utility he could obtain if he knew the agent’s distribution and the actual aggregate utility he obtains. We identify a broad class of games in which the principal’s optimal mechanism is static without any meaningful dynamics. The optimal dynamic mechanism, if it exists, simply repeats an optimal mechanism for a single-round problem in each round. The minimax regret is the number of rounds times the minimax regret in the single-round problem. The class of games includes repeated selling of identical copies of a single good or multiple goods, repeated principal-agent relationships with hidden information, and repeated allocation of a resource without money. Outside this class of games, we construct examples in which a dynamic mechanism provably outperforms any static mechanism.

A dynamic framework for updating approximations with increasing or decreasing objects in multi-granulation rough sets

The data we need to deal with is getting bigger and bigger in recent years, and the same happens to multi-granulation rough set, so updated schemes have been proposed with the variation of attributes or attribute values in multi-granulation rough sets, this paper puts forward a dynamic mechanism to update the approximations of multi-granulation rough sets when adding or deleting objects. Firstly, the relationships between the original approximations and updated approximations are explored when adding or deleting objects in multi-granulation rough sets, and the dynamic processes of updating optimistic and pessimistic multi-granulation rough approximations are proposed. Secondly, two corresponding dynamic algorithms are proposed to update the lower and upper approximations of optimistic and pessimistic multi-granulation rough sets. Finally, a great quantity of experiments had been implemented, and the results indicate that two dynamic algorithms proposed are more effective than the static algorithm.