On the pinning strategy of complex networks

In pinning control of complex networks, a tacit believing is that the system dynamics will be better controlled by pinning the large-degree nodes than the small-degree ones. Here, by changing the number of pinned nodes, we find that, when a significant fraction of the network nodes are pinned, pinning the small-degree nodes could generally have a higher performance than pinning the large-degree nodes. We demonstrate this interesting phenomenon on a variety of complex networks, and analyze the underlying mechanisms by the model of star networks. By changing the network properties, we also find that, comparing to densely connected homogeneous networks, the advantage of the small-degree pinning strategy is more distinct in sparsely connected heterogenous networks

A Mixed-Integer SDP Solution Approach to Distributionally Robust Unit Commitment with Second Order Moment Constraints

A power system unit commitment (UC) problem considering uncertainties of renewable energy sources is investigated in this paper, through a distributionally robust optimization approach. We assume that the first and second order moments of stochastic parameters can be inferred from historical data, and then employed to model the set of probability distributions. The resulting problem is a two-stage distributionally robust unit commitment with second order moment constraints, and we show that it can be recast as a mixed-integer semidefinite programming (MI-SDP) with finite constraints. The solution algorithm of the problem comprises solving a series of relaxed MI-SDPs and a subroutine of feasibility checking and vertex generation. Based on the verification of strong duality of the semidefinite programming (SDP) problems, we propose a cutting plane algorithm for solving the MI-SDPs; we also introduce a SDP relaxation for the feasibility checking problem, which is an intractable biconvex optimization. Experimental results on a IEEE 6-bus system are presented, showing that without any tunings of parameters, the real-time operation cost of distributionally robust UC method outperforms those of deterministic UC and two-stage robust UC methods in general, and our method also enjoys higher reliability of dispatch operation

NF-κB mediates the transcription of mouse calsarcin-1 gene, but not calsarcin-2, in C2C12 cells

BACKGROUND: The calsarcins comprise a novel family of muscle-specific calcineurin-interaction proteins that play an important role in modulating both the function and substrate specificity of calcineurin in muscle cells. The expression of calsarcin-1 (CS-1) is restricted to slow-twitch skeletal muscle fibres, whereas that of both calsarcin-2 (CS-2) and calsarcin-3 (CS-3) is enriched in fast-twitch fibres. However, the transcriptional control of this selective expression has not been previously elucidated. RESULTS: Our real-time RT-PCR analyses suggest that the expression of CS-1 and CS-2 is increased during the myogenic differentiation of mouse C2C12 cells. Promoter deletion analysis further suggests that an NF-κB binding site within the CS-1 promoter is responsible for the up-regulation of CS-1 transcription, but no similar mechanism was evident for CS-2. These findings are further supported by the results of EMSA analysis, as well as by overexpression and inhibition experiments in which NF-κB function was blocked by treatment with its inhibitor, PDTC. In addition, the overexpression of NFATc4 induces both the CS-1 and CS-2 promoters, whereas MEF2C only activates CS-1. CONCLUSION: Our present data suggest that NF-κB is required for the transcription of mouse CS-1 but not CS-2, and that the regulation of the calsarcins is mediated also by the NFAT and MEF2 transcription factors. These results provide new insights into the molecular mechanisms governing transcription in specific muscle fibre cells. The calsarcins may also serve as a valuable mechanistic tool to better understand the regulation of calcineurin signalling during muscle differentiation