Regulation Flexibility Assessment and Optimal Aggregation Strategy of Greenhouse Loads in Modern Agricultural Parks

With advances in modern agricultural parks,the rural energy structure has undergone profound change,leading to the emergence of an agricultural energy internet.This integrated system combines agricultural energy utilization,the information internet,and agricultural production.Accordingly,this study proposes a regulation flexibility assessment approach and optimal aggregation strategy of greenhouse loads(GHLs)for modern agricultural parks.First,taking into account the operational characteristics of typical GHLs,refined load demand models for lighting,humidification,and temperature-controlled loads are established.Secondly,the recursive least squares method-based parameter identification method is designed to accurately determine key GHL model parameters.Finally,based on the regulation flexibility of quantitatively evaluated GHLs,GHLs are optimally aggregated into multiple flexible aggregators considering minimal operational cost and greenhouse environmental constraints.The results indicate that the proposed regulation flexibility assessment approach and optimal aggregation strategy of GHLs can alleviate the peak regulation pressure on power grids by flexibly shifting the load demands of GHLs.

Modeling of aggregation kernels for fluidized beds using discrete particle model simulations

Aggregation is one of the many important processes in chemical and process engineering. Several researchers have attempted to understand this complex process in fluidized beds using the macro-model of population balance equations （PBEs）. The aggregation kernel is an effective parameter in PBEs, and is defined as the product of the aggregation efficiency and collision frequency functions. Attempts to derive this kernel have taken different approaches, including theoretical, experimental, and empirical techniques. The present paper calculates the aggregation kernel using micro-model computer simulations, i.e., a discrete particle model. We simulate the micro-model without aggregation for various initial conditions, and observe that the collision frequency function is in good agreement with the shear kernel. We then simulate the micro-model with aggregation and calculate the aggregation efficiency rate.

Social Choice Meets Graph Drawing: How to Get Subexponential Time Algorithms for Ranking and Drawing Problems

We analyze a common feature of p-Kemeny AGGregation（p-KAGG） and p-One-Sided Crossing Minimization（p-OSCM） to provide new insights and findings of interest to both the graph drawing community and the social choice community. We obtain parameterized subexponential-time algorithms for p-KAGG—a problem in social choice theory—and for p-OSCM—a problem in graph drawing. These algorithms run in time O＊（2O（√k log k））,where k is the parameter, and significantly improve the previous best algorithms with running times O.1.403k/and O.1.4656k/, respectively. We also study natural ＂above-guarantee＂ versions of these problems and show them to be fixed parameter tractable. In fact, we show that the above-guarantee versions of these problems are equivalent to a weighted variant of p-directed feedback arc set. Our results for the above-guarantee version of p-KAGG reveal an interesting contrast. We show that when the number of ＂votes＂ in the input to p-KAGG is odd the above guarantee version can still be solved in time O＊（2O（√k log k））, while if it is even then the problem cannot have a subexponential time algorithm unless the exponential time hypothesis fails（equivalently, unless FPT D M[1]）.