Efficient algorithms for the computation of optimum stable models are based on unsatisfiable core analysis. However, these algorithms essentially run to completion, providing few or even no suboptimal stable models. This drawback can be circumvented by shrinking unsatisfiable cores. Interestingly, the resulting anytime algorithm can solve more instances than the original algorithm.

∣ 2 u dV. This implies in particular that d dt μ(g(t), τ(t)) ≥ 0 with equality exactly for homothetically shrinking solutions of Ricci flow. An important consequence of this entropy formula is a lower volume ratio bound for solutions of Ricci flow on a closed manifold for a finite time interval [0, T ) asserting the existence of a constant κ > 0, only depending on n, T and g(0), such that the i...

  Abstract   The effect of mechanical activation using an attrition mill on the particle size of an ilmenite concentrate and its effect on the ability of the concentrate for Iron separation during hydrochloric acid leaching and the kinetics of the dissolution process have been investigated. It was observed that mechanical activation in an attritor significantly enhances the dissolution of iron ...

In this work, the effect of carbon dioxide partial pressure on the calcination kinetics of high purity zinc carbonate hydroxide has been studied. Non-isothermal analysis has been performed on samples at different CO2 partial pressures by TGA and DTA. It has been found that the calcination behaviour of this material corresponds to the shrinking core model and the reaction mechanism is phase boun...

In this correspondence, it is given a correction to Theorem 4 in Y. Hu, and G. Xiao, “Generalized Self-Shrinking Generator,” IEEE Transactions on Information Theory, vol. 50, No. 4, pp. 714-719, April 2004.

In 2004, Y. Hu and G. Xiao introduced the generalized self-shrinking generator, a simple bit-stream generator considered as a specialization of the shrinking generator as well as a generalization of the self-shrinking generator. The authors conjectured that the family of generalized self-shrinking sequences took their least periods in the set {1, 2, 2}, where L is the length of the Linear Feedb...

The need of software-flexible stream ciphers has led to several alternative proposals in the last few years. One of them is a new Pseudo Random Number Generator (PRNG), named N-adic Summation-Shrinking (NSumSG), which architecture is described in this paper. It uses N-1 parallel working slave summation generators and one N-adic summation generator, controlling the nonlinearity in the generator....

This work shows that the cryptanalysis of the shrinking generator requires fewer intercepted bits than that indicated by the linear complexity. Indeed, whereas the linear complexity of shrunken sequences is between A·2(S−2) and A·2(S−1), we claim that the initial states of both component registers are easily computed with less than A · S shrunken bits. Such a result is proven thanks to the defi...