The CO2 transcritical distributed compression cycle proposal provides a novel approach for refrigerant cooling in traditional transcritical cycles. This paper employed an exhaustive search method to derive the correla...
详细信息
The CO2 transcritical distributed compression cycle proposal provides a novel approach for refrigerant cooling in traditional transcritical cycles. This paper employed an exhaustive search method to derive the correlation formula for the optimal intermediate pressure. From the perspectives of thermodynamic performance and economics, a comparative analysis was conducted between the cycle established under the optimal intermediate pressure obtained in this study, the cycle based on equal compression ratios in traditional two-stage compression cycles, and the cycle established using the optimal secondary compression ratio method based on low-pressure stage discharge pressure mentioned in previous literature study. The research results indicate that the system's COP calculated using the obtained optimal intermediate pressure correlation method can be improved by up to 7.26% and 5.32%, respectively, compared to the traditional and literature-based methods. The exergy loss with the optimal intermediate pressure method is less than with the other two methods. The entransy dissipation rate of the system obtained using the optimal intermediate pressure correlation method is 24.61% and 50.14% lower than that of the traditional and literature-based methods, respectively. The investment cost of the main components using the optimal intermediate pressure correlation method is about 5% higher than that of the traditional method and about 1% higher than that of the optimal pressure ratio method. However, the total annual cost rate of the system is the lowest. The research enriches and improves the theory of the CO2 transcritical distributed compression cycle, thereby facilitating the advancement of practical applications based on this cycle theory.
Purpose: To derive simple, approximate analytical formulas for critical buckling loads of uniform columns under combined end and linearly distributed axial compression for common boundary conditions. Methods: The end ...
详细信息
A good understanding of individual and collective wind farm operation is necessary for improving the overall performance of the wind farm "grid," as well as estimating in real time the amount of energy that ...
详细信息
A good understanding of individual and collective wind farm operation is necessary for improving the overall performance of the wind farm "grid," as well as estimating in real time the amount of energy that can be generated for effectively managing demand and supply over the smart grid. This paper proposes a scheme for compressing wind speed measurements exploiting both temporal and spatial correlation between the readings via distributed source coding. The proposed scheme relies on a correlation model based on true measurements. Two compression schemes are proposed, both of low encoding complexity, as well as a particle-filtering-based belief propagation decoder that adaptively estimates the nonstationary noise of the correlation model. Simulation results using realistic models show significant performance improvements compared to the scheme that does not dynamically refine correlation.
In contrast to time series, graphical data is data indexed by the vertices and edges of a graph. Modern applications such as the internet, social networks, genomics and proteomics generate graphical data, often at lar...
详细信息
In contrast to time series, graphical data is data indexed by the vertices and edges of a graph. Modern applications such as the internet, social networks, genomics and proteomics generate graphical data, often at large scale. The large scale argues for the need to compress such data for storage and subsequent processing. Since this data might have several components available in different locations, it is also important to study distributed compression of graphical data. In this paper, we derive a rate region for this problem which is a counterpart of the Slepian-Wolf theorem. We characterize the rate region when the statistical description of the distributed graphical data can be modeled as being one of two types - as a member of a sequence of marked sparse Erdos-Renyi ensembles or as a member of a sequence of marked configuration model ensembles. Our results are in terms of a generalization of the notion of entropy introduced by Bordenave and Caputo in the study of local weak limits of sparse graphs. Furthermore, we give a generalization of this result for Erdos-Renyi and configuration model ensembles with more than two sources.
In order to estimate the amount of energy that will be generated by a wind farm and provide efficient power distribution planning, it is necessary to deliver information of wind speed at all wind turbines. This paper ...
详细信息
ISBN:
(纸本)9781467300469
In order to estimate the amount of energy that will be generated by a wind farm and provide efficient power distribution planning, it is necessary to deliver information of wind speed at all wind turbines. This paper proposes a scheme for compressing wind speed measurements exploiting both temporal and spatial correlation between the turbine readings via distributed source coding. The proposed scheme relies on a correlation model based on true measurements. A compression scheme proposed is of low encoding complexity and uses a particle-filtering based belief propagation decoder that adaptively estimates the nonstationary noise of the correlation model. Simulation results using realistic models show significant performance improvements compared to the scheme that does not dynamically refine correlation.
We consider the problem of distributed compression of the difference Z = Y-1 - cY(2) of two jointly Gaussian sources Y-1 and Y-2 (with positive correlation coefficient rho and positive c) under an MSE distortion const...
详细信息
ISBN:
(纸本)9781457705953
We consider the problem of distributed compression of the difference Z = Y-1 - cY(2) of two jointly Gaussian sources Y-1 and Y-2 (with positive correlation coefficient rho and positive c) under an MSE distortion constraint D on Z. The rate region for this problem is unknown. We provide a new lower bound on the minimum sum-rate by utilizing the connection of the above problem with the two-terminal source coding problem with matrix-distortion constraint. Our lower bound not only improves existing bounds in many cases, but also allows us to prove sum-rate tightness of the Berger-Tung scheme when c is either relatively small or large and D is larger than some threshold. Furthermore, our lower bound enables us to show that the improved lattice-based scheme recently introduced in [1] (with the smallest achievable sum-rate) performs within 1.18 b/s from the optimal sum-rate for all values of rho, c, and D.
Wireless sensor network (WSN) technology provides support infrastructure to solve blind zone coverage. Previous studies mainly focus on deployment and management of sensor nodes for enhancing signal coverage on a spec...
详细信息
ISBN:
(纸本)9781509003044
Wireless sensor network (WSN) technology provides support infrastructure to solve blind zone coverage. Previous studies mainly focus on deployment and management of sensor nodes for enhancing signal coverage on a specific zone. But few of them are on coordinating several nodes to recognize blind zone. Moreover, it is a great challenge how to extract, transmit and process information energy efficiently in a decentralized way. In this paper, we propose a distributed algorithm for convenient and efficient blind zone recognition based on the early work on the unbiased broadcast gossip algorithm (UBGA) and the compressed sensing. Using UBGA, a faster consensus algorithm, the system can simultaneously compute the compressed data based on compressed sensing technique and disseminate them throughout the network. From these compressed data one can reconstruct the original data with approximate accuracy by querying any sensor values using the gradient projection strategy. Simulation results illustrate that our solution, proposed in this paper, can effectively recognize blind zone.
Consider a lossy compression system with l-distributed encoders and a centralized decoder. Each encoder compresses its observed source and forwards the compressed data to the decoder for joint reconstruction of the ta...
详细信息
Consider a lossy compression system with l-distributed encoders and a centralized decoder. Each encoder compresses its observed source and forwards the compressed data to the decoder for joint reconstruction of the target signals under the mean-squared-error distortion constraint. It is assumed that the observed sources can be expressed as the sum of the target signals and the corruptive noises, which are generated independently from two symmetric multivariate Gaussian distributions. Depending on the parameters of such distributions, the rate-distortion limit of this system is characterized either completely or at least for sufficiently low distortions. The results are further extended to the robust distributed compression setting, where the outputs of a subset of encoders may also be used to produce a non-trivial reconstruction of the corresponding target signals. In particular, we obtain in the high-resolution regime a precise characterization of the minimum achievable reconstruction distortion based on the outputs of k + 1 or more encoders when every k out of all l encoders are operated collectively in the same mode that is greedy in the sense of minimizing the distortion incurred by the reconstruction of the corresponding k target signals with respect to the average rate of these k encoders.
An adaptive signal-processing-aided distributed source coding scheme for virtual multiple-input-multiple-output communication-based wireless sensor networks (WSNs) is proposed. A computationally inexpensive distribute...
详细信息
An adaptive signal-processing-aided distributed source coding scheme for virtual multiple-input-multiple-output communication-based wireless sensor networks (WSNs) is proposed. A computationally inexpensive distributed compression scheme that exploits the spatiotemporal correlations of sensor data is implemented with the aid of a recursive least squares (RLS)-based adaptive correlation tracking algorithm. The tracked correlation is used to compute side information that assists in distributed source compression. The proposed virtual space-time block coding and RLS-based compression side information are shown to improve energy efficiency at distributed nodes compared to previously proposed schemes With single-input-single-output communication. A semi-analytical approach is developed for energy efficiency analysis over different channel conditions and transmission distances. The energy efficiency performance of the proposed design is evaluated on real WSN data. The results show that the proposed integrated system outperforms conventional designs beyond certain transmission distance thresholds and leads to lower decoding errors, which makes it a good candidate for energy-aware WSNs.
distributed compression of a pair of Gaussian sources in which the goal is to reproduce a linear function of the sources at the decoder is considered. It has recently been noted that lattice codes can provide improved...
详细信息
distributed compression of a pair of Gaussian sources in which the goal is to reproduce a linear function of the sources at the decoder is considered. It has recently been noted that lattice codes can provide improved compression rates for this problem compared to conventional, unstructured codes. It is first shown that the state-of-the-art lattice scheme can be improved by including an additional linear binning stage. An outer bound on the rate-distortion region and a separate lower bound on the optimal sum rate are then established. The outer bound implies that for the special case of communicating the difference of two positively correlated Gaussian sources, the unimproved lattice scheme achieves within one bit of the rate region at any distortion level. The sum rate lower bound implies that unstructured codes achieve within one bit of the optimal sum rate whenever the weights of the two sources in the linear combination differ by more than a factor of two.
暂无评论