Accordingly to the properties of zeotropic mixture R32:R236fa, a novel double-temperature chilling water unit was proposal in this paper, this unit can produce two different temperature of chilled water (such as low temperature is 7 °C, high temperature is 16 °C). An experimental system is established to test the performance of the unit. The paper studied the effects of mass component concentrations of the zeotropic mixture and high - low temperature evaporator's source temperature on the performance of the unit. The results show that, when the inlet water temperature of the condenser is 32 °C, outlet water temperature of the evaporator is 7 °C and 16 °C. The coefficient of performance (COP) of the unit can reach 4.14 when the mass component concentration of R32 is 60% and the COP of the unit increase with the increase of mass component concentration of R32 and the chilled water temperature.
A novel and efficient two-channel router using separate data and control packet channels is proposed for networks-on-chip. The new scheme is compared with the traditional signal-channel and virtual-channel routers under the same traffic conditions and constraints. The simulation results show that the proposed router performs better in terms of throughput and average delay. The gate count of the router is only 20 500, and the router area after synthesis is 0.103 mm2 under SMIC 0.13 μm CMOS process technology.
This letter examines the fixed-time stability of the Nash equilibrium (NE) in non-cooperative games.We propose a consensus-based NE seeking algorithm for situations where players do not have perfect information and communicate via a topology graph.The proposed algorithm can achieve NE in a fixed time that does not depend on initial conditions and can be adjusted in advance.In this strategy, players use their estimates of other players' actions to update their own actions.We present sufficient conditions that ensure the fixedtime stability of the NE through rigorous Lyapunov stability analysis.Finally, we provide an example to verify the feasibility of the theoretical result.Game theoretic methods have become prevalent in engineering applications, such as power allocation [1], cooperative control [2],[3], energy consumption control [4], and self-driving [5].Once a specific problem has been modeled as a game, the question becomes how to find the NE.In a game, each player aims to find a strategy that minimizes its own cost function.The NE of a game is a set of actions for which players can no longer decrease their cost functions by solely changing their own actions.In [1], the zero-sum game of two networks of agents was investigated.The potential game and aggregate game were considered in [2] and [4], respectively.For more generalized non-cooperative games, an extreme seeking based method was developed in [6], but it required global information, which may not be applicable to practical problems.To tackle this issue, researchers have paid attention to studying NE seeking strategies under imperfect information.In [7], a gossip-based algorithm was designed for discrete-time NE seeking.In [8], the authors proposed a continuous-time NE seeking algorithm that incorporates a consensus protocol [9]- [14].A passivity-based approach was developed in [15] for nonlinear and heterogeneous players.The papers [16]-[18] studied NE seeking under disturbance, control input saturation, and switching topologies, respectively.The convergence rate is an important index for evaluating system performance.While the aforementioned results all achieved NE with an asymptotic convergence rate, where the fastest rate is exponential, the infinite convergence time usually does not meet the requirement of practical systems.To acquire NE more quickly, Fang et al. [19] proposed two finite-time NE seeking algorithms that employ signum and saturation functions.However, the convergence time of the finite-time result is related to the initial conditions, which are not always available in practice.To overcome this disadvantage, the authors of [20] proposed a fixed-time NE seeking algorithm based on extreme seeking.The prescribed-time algorithms were developed based on the motion-planning method in [21] and the time base gen-
This paper addresses the problem of fixed-time consensus algorithm for the second-order multi-agent systems with bounded disturbances. The proposed fixed-time protocol can ensure a fixed-time consensus. First, the control law is designed to make the true speed track the virtual speed in a fixed time based on the fixed-time control method. Then, based on the backstepping design method, the virtual speed is designed, which makes the consensus be achieved in a fixed-time. Compared with the finite-time consensus results, the fixed-time consensus results can ensure the convergence settling time regardless of the initial states of the agents. Finally, a example is presented to show the effectiveness of the fixed-time consensus algorithm.
Presents a solution to a reliable filtering problem with error variance specifications. A given higher bound of the filtering error variance in the sensor failure cases is guaranteed and the performance in the nominal case is optimized. A new formulation in terms of LMI is adopted without introducing additional conservativeness. An iterative algorithm is given to obtain the solution, which is illustrated by a numerical example.
As an important platform to support cyberspace security technology verification, cyberspace attack and defense equipment performance testing, and cyberspace attack and defense rehearsal confrontation; the network security test platform plays an increasingly important role in the field of network security research. With the rapid development of cloud computing and big data, the network security test cloud platform shows the characteristics of explosive growth of data volume, among which the value of massive log data is particularly important. Through log analysis, abnormal events and behaviors can be found in a timely manner, but the traditional log detection technology appears to be incompetent for the analysis of massive log data, and the log detection and analysis technology based on Elastic Stack can realize real-time collection and retrieval of massive log data, and then realize effective detection and analysis of abnormal events in the network security test cloud platform.
With the number of cores and nodes in networks-on-chips (NoCs) growing, the node fault occurrence probability is increasing. Although the existing turn model can route packets around the fault area and avoid deadlocks, a large traffic load is generated in the non-rightmost column of the fault region. This paper presents a novel fault-tolerant and congestion balanced (FTCB) routing algorithm that chooses a lower load area as the optimal router path by calculating the maximum path channels to balance traffic load and avoid network congestion. Two methods are proposed to calculate path channels for the fault-free mesh and the fault mesh. The improved odd-even turn rule is introduced to calculate path channels for the fault-free mesh. To balance the network load, free buffer length information is added to path channel calculations, which reflects the global perception. For the non-fault region, we update path channels by using the back formulas from the destination node to the source node. In a fault region, the modified calculation rules of path channels and fault-location odd-even turn rules are given. Compared to the other two related works, the throughput of the FTCB algorithm is improved by 6.92% and 10.7%. Meanwhile, the traffic load of FTCB is decreased to some degree in whole mesh, which shows the FTCB routing algorithm can obviously improve network load balanced, saturation throughput and network latency.
In this letter, a multiuser relay network with massive multiple-input multiple-output is investigated with mixed-analog-to-digital converter (ADC) at receiver. We first characterize the uplink achievable rate by deriving a tight approximation, which embraces the conventional unquantized system as a special case. Both power scaling laws at sources and relay are presented. It is validated that the performance loss due to low-precision ADCs can be compensated by increasing the number of antennas M, obeying a logarithmical scaling law, rather than by increasing the transmit power at sources and/or relay. We show that the performance suffers from a loss factor interpreted as a nominal effective resolution of the entire mixed-ADC structure. Simulation results verify our observations.
'/%3e%3cuse xlink:href='%23a' transform='rotate(23.036 .093 25.536)'/%3e%3cuse xlink:href='%23a' transform='rotate(45.87 1.273 16.18)'/%3e%3cuse xlink:href='%23a' transform='rotate(69.945 .996 12.078)'/%3e%3cuse xlink:href='%23a' transform='rotate(20.66 -19.689 31.932)'/%3e%3c/svg%3e)