An improved Ritt-Wu’s decomposition (of an algebraic set into the union of irreducible varieties) algorithm is given. The algorithm has been used to prove geometric theorems that Wu’s original method addresses. Unlike Wu’s original approach, nondegenerate conditions are given explicitly at the beginning, not generated during the proof process. A program based on this improved version of the alg...

We give an overview of Sattolo’s algorithm, which allows to perform random generation of a cyclic permutation of a fixed number of elements. In Section 1, we describe the algorithm and prove its correctness by using a recursive proof which parallelizes the recursive structure of the algorithm. The recursive structure also allows to analyze two simple parameters associated to the algorithm. As w...

A single period inventory model, also popularly known as the Newsboy or Christmas tree problem, is to decide the quantity of a single product to be manufactured or purchased for a single period such that the quantity maximizes (minimizes) the expected profit (cost) under stochastic demand. The earliest works in this area were those by Hadley and Whittin (1963) and Hodges and Moore (1970). The l...

block ciphers have wide applications for hardware and software implementations. in this paper, a new block cipher algorithm with provable security is proposed. the whole structure of the algorithm is novel and has a good encryption and decryption performance. additionally, it has good security with few number of rounds. the structure of the proposed algorithm consists of 4-rounds feistel-like w...

In the process of anaerobic dry fermentation to produce biogas, maintaining a suitable pH in environment is more conducive degradation crop straw. When too low, digestion by bacteria inhibited. Therefore, it necessary quickly adjust pH. this work, we studied control technology regulation system and then constructed T-S fuzzy controller. Upon simplifying controller, delay time was reduced, two g...

The main challenge of a search engine is ranking web documents to provide the best response to a user`s query. Despite the huge number of the extracted results for user`s query, only a small number of the first results are examined by users; therefore, the insertion of the related results in the first ranks is of great importance. In this paper, a ranking algorithm based on the reinforcement le...