The energy efficient problem of parallel-connected pumps in heating, ventilation, and air-conditioning (HVAC) systems has received an increasing attention in recent years. While many pump optimization methods are proposed and show great performance, pumps are not always energy efficient and lack flexibility. In this paper, we propose a distributed control algorithm for parallel pumps in HVAC system in a peer-to-peer setting. Based on a spanning tree of the network of the intelligent nodes and a population of potential solutions randomly sampled, the algorithm makes optimal control decision for pumps to minimize energy consumption and meet the system demand. The theoretical analysis on convergence of the algorithm is established. Unlike traditional control structure, the whole system is fully distributed and each pump is controlled by an intelligent node that runs identical control code and coordinates with other nodes through direct data exchange. Simulation experiments on 6 parallel-connected pumps are provided for different working cases to demonstrate the effectiveness of the proposed algorithm and compare with other four methods. The results show that our method strictly satisfies the demand constraint and presents a good energy saving potential, the convergence guarantee, the flexibility. The maximum energy saving can be up to 29.92%. Besides, the hardware test clearly presents that our method can perform on low-cost Raspberry Pi3 and reduce system cost.

The power system vulnerability leads to faults and the severity of the fault may lead to prolonged load-shedding. The power system needs to be configured in extreme failure scenarios for protecting the network from further contingencies and prolonged load-shedding. Distributed generation resources (DGs) can be useful to form intentional islands after faults to maintain the continuity of power supply to loads based on their weightage during faulty periods and to reduce overall load shedding duration. Power system is bound to collapses and secondary collapse in the formed island is possible. This research represents a novel method of impedance based path finding for intentional islanding, which adapts itself with the changes in the demands, DGs outputs or further severities during restoration period. In this adaptive islanding approach, network adjusts itself with the changes in either the load demands or renewable DGs outputs and rearranges the restoration plan by curtailing or adding some of the loads through controllable switches. Further a secondary collapse in the existing island is studied by injecting multiple faults at various positions of the network to validate the system resilience to cope with severities. A short-term load forecasting approach is used to predict changes in load demands and variations in DG outputs during the islanding scheme. During the restoration period, these variations are tracked and the islands are modified accordingly. In order to minimize the overall generation cost by using less fuel, an economical approach is used in the selection of controllable DGs. The proposed approach is formulated as a multi-objective, that incorporates several operational constraints and simulation is carried out using the modified IEEE 69-bus distribution system to assess the efficacy of the proposed model.

In order to reveal the impact of boundary-spanning activities of cooperative innovation teams on team innovation performance, this paper takes the panel data of 71 cooperative innovation teams from January to November 2022 as the research sample. It introduces intermediary variables (teamwork crafting and individual work crafting) to analyze the impact mechanism of boundary-spanning activities of teams on innovation performance, 71 teams were divided into 41 experimental groups and 30 control groups, and a quasi-natural experiment was conducted on the innovation performance of team boundary-spanning activities using the Double Difference Model (DID).Research has shown that boundary-spanning activities of collaborative innovation teams can promote team innovation performance. Team job crafting has a mediating effect on team innovation performance in boundary-spanning activities of collaborative innovation teams. Team job crafting and individual job crafting mediate between the boundary-spanning activities of collaborative innovation teams and team innovation performance. Further analysis using the double difference model found that compared to teams without boundary-spanning activities, teams with boundary-spanning activities can directly improve team innovation performance. When team reflection is vital, and task interdependence is high, it will promote team innovation performance. This research enriches the research on the effects of boundary-spanning activities of collaborative innovation teams, explores solutions based on quasi-nature, and provides a reference for improving the team innovation performance of collaborative innovation teams.

Every biological image contains quantitative data that can be used to test hypotheses about how patterns were formed, what entities are associated with one another, and whether standard mathematical methods inform our understanding of biological phenomena. In particular, spatial point distributions and polygonal tessellations are particularly amendable to analysis with a variety of graph theoretic, computational geometric, and spatial statistical tools such as: Voronoi Polygons; Delaunay Triangulations; Perpendicular Bisectors; Circumcenters; Convex Hulls; Minimal Spanning Trees; Ulam Trees; Pitteway Violations; Circularity; Clark-Evans spatial statistics; Variance to Mean Ratios; Gabriel Graphs; and, Minimal Spanning Trees. Furthermore, biologists have developed a number of empirically related correlations for polygonal tessellations such as: Lewis’s Law (the number of edges of convex polygons are positively correlated with the areas of these polygons): Desch’s Law (the number of edges of convex polygons are positively correlated with the perimeters of these polygons); and Errara’s Law (daughter cell areas should be roughly half that of their parent cells’ areas). We introduce a new Pitteway Law that the number of sides of the convex polygons in a Voronoi tessellation of biological epithelia is proportional to the minimal interior angle of the convex polygons as angles less than 90 degrees result in Pitteway violations of the Delaunay dual of the Voronoi tessellation.

In IP networks, packet forwarding is destination-based and hop-by-hop, and routes are built as needed. Kwong et al. introduced a protection routing in which packet delivery to the destination node can proceed uninterrupted in the event of any single node or link failure. He then shows that “whether there is a protection routing to the destination” is NP-complete. Tapolcai find that two completely independent spanning trees, abbreviated as CISTs, can be used to configure the protection routing. In this paper, we propose dual protection routing trees, denoted as dual-PRTs to replace CISTs, which are less restrictive than CISTs. Next, we propose a transformation algorithm that uses dual-PRTs to configure the protection routing. Taking complete graphs Kn, complete bipartite graphs Km,n, hypercubes Qn, locally twisted cubes LTQn as examples, we provide a recursive method to construct dual-PRTs on them. This article will show that there are no two CISTs on K3,3, Q3, and LTQ3, but there exist dual-PRTs that can be used to configure the protection routing. As shown in the performance evaluation of simulation results, for both Qn and LTQn, we get the average path length of protection routing configured by dual-PRTs is shorter than that by two CISTs.