Generating Empirical Core Size Distributions of Hedonic Games Using a Monte Carlo Method

Hedonic games have gained popularity over the last two decades, leading to several research articles that have used analytical methods to understand their properties better. In this paper, a Monte Carlo method, a numerical approach, is used instead. Our method includes a technique for representing, and generating, random hedonic games. We were able to create and solve, using core stability, millions of hedonic games with up to 16 players. Empirical distributions of the hedonic games’ core sizes were generated, using our results, and analyzed for games of up to 13 players. Results from games of 14–16 players were used to validate our research findings. Our results indicate that core partition size might follow the gamma distribution for games with a large number of players.

A Fast CU Size Decision Optimal Algorithm based on Coding Bits for HEVC

HEVC (High Efficiency Video Codng) employs quadtree CTU (Coding Tree Unit) structure to improve its coding efficiency, but at the same time, it also requires a very high computational complexity due to its exhaustive search process for an optimal partition mode for the current CU(Coding Unit). Aiming to solve the problem, a fast CU size decision optimal algorithm based on coding bits is presented for HEVC in this paper. The contribution of this paper lies that we successfully use the coding bits technology to quickly determine the optimal partition mode for the current CU. Specially, in our scheme, firstly we carefully observe and statistically analyze the relationship among the texture complexity and partition size and coding bits in the CUs of video image; Secondly we find the correlation between coding bits and partition size based on the relationship above; Thirdly, we build the corresponding threshold of coding bits for partition size under different CU size and QP value based on the correlation above to reduce many unnecessary prediction and partition operations for the current CU. As a result, our proposed algorithm can effectively saving lots of computational complexity for HEVC. The simulation results show that our proposed fast CU size decision algorithm based on coding bits in this paper can save about 34.67% coding time, and only at a cost of 0.61% BDBR increase and 0.043db BDPSNR decline compared with the standard reference of HM16.1, thus improving the coding performance of HEVC.

Computational and Experimental Study of the Effect of Operating Parameters on Classification Performance of Compound Hydrocyclone

Compound hydrocyclone is a kind of dynamic hydrocyclone also with the advantages of static hydrocyclone. In this investigation, the effect of operating parameters on separation performance of compound hydrocyclone is studied using both CFD technique and experimental method. The flow field of compound hydrocyclone was simulated by the RSM turbulence model; the particles with different size were simplified to 6 phases and simulated by the mixture multiphase model. The central composite design method was used to conduct the separation experiment of compound hydrocyclone. The results indicated that compound hydrocyclone can be used for finer particles separation and the flow field of compound hydrocyclone can still achieve a higher centrifugal force in lower inlet velocity. When the minimum partition size is required, the optimized operating condition of the compound hydrocyclone is v = 2.5 m/s, n = 1865 rpm, and c = 7.5%, while when the maximum partition size is required, the optimized operating condition is v = 2.5 m/s, n = 905 rpm, and c = 24.5%.

A Robust H.264/AVC Video Watermarking Scheme with Drift Compensation

A robust H.264/AVC video watermarking scheme for copyright protection with self-adaptive drift compensation is proposed. In our scheme, motion vector residuals of macroblocks with the smallest partition size are selected to hide copyright information in order to hold visual impact and distortion drift to a minimum. Drift compensation is also implemented to reduce the influence of watermark to the most extent. Besides, discrete cosine transform (DCT) with energy compact property is applied to the motion vector residual group, which can ensure robustness against intentional attacks. According to the experimental results, this scheme gains excellent imperceptibility and low bit-rate increase. Malicious attacks with different quantization parameters (QPs) or motion estimation algorithms can be resisted efficiently, with 80% accuracy on average after lossy compression.

Stability Analysis of Linear Discrete-Time Systems with Interval Delay: A Delay-Partitioning Approach

This paper considers the problem of asymptotic stability of linear discrete-time systems with interval-like time-varying delay in the state. By using a delay partitioning-based Lyapunov functional, a new criterion for the asymptotic stability of such systems is proposed in terms of linear matrix inequalities (LMIs). The proposed stability condition depends on both the size of delay and partition size. The presented approach is compared with previously reported approaches.