On the basis of analyzing the classical algorithms of network clustering and community detecting, a new algorithmic method of discovery of community was brought up, which has different thinking from previous algorithms. In this method a general network is looked upon as a corresponding electrical network firstly, the link in between the connected pairs of nodes is substituted by a fixed resisto...

We present fast sintering for silver (Ag) nanoparticle (NP) and flake layers printed using roll-to-roll (R2R) gravure printing. An infrared (IR) sintering module was applied to an R2R system to shorten the sintering duration of an R2R gravure-printed Ag layer. IR sintering of the conductive layer was improved by optimising the process condition. After printing of the Ag NP and Ag flake layers, ...

A key goal of invasion biology is to identify the factors that favor species invasions. One potential indicator of invasiveness is the phylogenetic distance between a nonnative species and species in the recipient community. However, predicting invasiveness using phylogenetic information relies on an untested assumption: that both biotic resistance and facilitation weaken with increasing phylog...

A buried pipeline can buckle upwards if there is not enough resistance to movement. Both the uplift resistance (the maximum force per unit length) and the mobilisaion distance (the distance the pipeline has move before the maximum force is reached) are important in design. Tests on pipes in several soils were carried out at 1 g at full scale and in a centrifuge at 10 g and 1/10 scale. A compari...

We investigate the dependence of transmission losses on the choice of a slack bus in high voltage AC transmission networks. We formulate a transmission loss minimization problem in terms of slack variables representing the additional power injection that each generator provides to compensate the transmission losses. We show analytically that for transmission lines having small, homogeneous resi...

A large body of network-related problems can be formulated or explained by Moore-Penrose inverse of the graph Laplacian matrix of the network. This paper studies the impact of overlaying or removing a subgraph (inserting / removing a group of links, or modifying a set of link weights) on MoorePenrose inverse of the Laplacian matrix of an existing network topology. Moreover, an iterative method ...