In this paper, an efficient chaos-based image encryption scheme is proposed, which uses the imitating jigsaw method containing revolving and shifting operations. In this scheme, there are three processes in encryption: preprocessing, encryption process, and postprocessing. In the preprocessing, the original image is partitioned into 64 × 64 pixel image blocks and then randomly revolved and shifted under control sequences which are generated by the hyperchaotic Lorenz system whose initial conditions are calculated by original image and keys. Therefore, the preprocessing (...) is sensitive to plain image against differential attacks. In the encryption process, the after-preprocessing image is partitioned into 32 × 32 pixel image blocks; next they are randomly revolved and encrypted by control sequence and key blocks which are generated by the skew tent map. In postprocessing, the after-encryption image is partitioned into 16 × 16 pixels’ image blocks, and they are randomly revolved and shifted again under control sequences which are related with encrypted image and keys. The postprocessing further increases the diffusion characteristics. Moreover, the test experiment and security analyses are given; the results show that our proposed cryptosystem has both security and speed performance. (shrink)

Model RB is a model of random constraint satisfaction problems, which exhibits exact satisfiability phase transition and many hard instances, both experimentally and theoretically. Benchmarks based on Model RB have been successfully used by various international algorithm competitions and many research papers. In a previous work, Xu and Li defined two notions called i-constraint assignment tuple and flawed i-constraint assignment tuple to show an exponential resolution complexity of Model RB. These two notions are similar to some kind of consistency in (...) constraint satisfaction problems, but seem different from all kinds of consistency so far known in literatures. In this paper, we explicitly define this kind of consistency, called variable-centered consistency, and show an upper bound on a parameter in Model RB, such that up to this bound the typical instances of Model RB are variable-centered consistent. (shrink)

Moral hypocrisy (MH) occurs when people fail to practice what they preach. Despite the prevalence of the effect of social identity on an individual’s MH, few empirical studies have explored contextual factors that may help reduce MH. By conducting two experiments based on the research paradigm of real stranger presence, we examined how in-group and out-group strangers’ presence and moral behavior may contribute to reducing MH. The results of experiment 1 demonstrated that compared with the presence of out-group strangers, the (...) presence of in-group stranger could effectively inhibit MH (no significant difference between participants reported and actual donation proportions was obtained). The results of experiment 2 replicated and extended the results of experiment 1, first by showing that the presence of in-group strangers could effectively inhibit MH and then by revealing the influence of present strangers’ behavior (moral or hypocritical) on MH. The results indicated that strangers’ moral behavior could effectively eliminate participants’ MH, especially in the presence of in-group strangers. However, when present strangers exhibited hypocritical behavior, they exhibited no effect on participants’ MH, irrespective of the condition of in-group and out-group strangers. The current study provides empirical support for theories related to MH and moral decision making and contributes to the literature on in-group and out-group effects on MH and decision making. (shrink)

By PFM, we mean a finitely generated module over a principal ideal domain; a linear sentence is a sentence that contains no disjunctive and negative symbols. In this paper, we present an algorithm which decides the truth for linear sentences on a given PFM, and we discuss its time complexity. In particular, when the principal ideal domain is the ring of integers or a univariate polynomial ring over the field of rationals, the algorithm is polynomial-time. Finally, we consider some applications (...) to Abelian groups. (shrink)

本论文集收有文章20余篇,分为:论毛泽东思想、论美的本质、论创作直觉、论文艺批评等11部分。.

本书是运用马克思主义的基本观点研究价值论问题的学术著作,研究了价值的本质、价值的评价、价值选择和价值的特性等问题。.