In a database system a buffer may be used to hold recently referenced pages. If this buffer is in virtual memory, the database paging system and the memory paging system affect its performance. The study of the effect of main memory replacement algorithms on the number of main memory page faults is the basic objective of this paper. We assume that the buffer replacement algorithm is least recen...

In this paper, the real-time path avoidance problem of multirotor UAV in case sudden obstacles two-dimensional environment is studied. The principle, model, and application ant colony algorithm are analyzed. On basis, adaptive dynamic window proposed, method designed; heuristic function adding obstacle detection factors double pheromone update strategy made to algorithm, improved used replan wi...

In this paper we are studying the relations between generated and accepted hyperedge replacement languages. In context freeness of hyperedge replacement grammars we can transform each grammar into an equivalent one in Greibach Normal Form (HRGNF). In order to create a pushdown automata for hyperedge replacement languages (PDAH) we build an algorithm to transform the planar structure of a hyperg...

A virtual memory system needs efficient page replacement algorithms to decide which pages to evict from memory in case of a page fault. Over the years many algorithms have been proposed for page replacement. Each algorithm attempts to minimize the page fault rate while incurring minimum overhead. As newer memory access patterns were explored, research mainly focused on formulating newer approac...

An augmented compact genetic algorithm (acGA) is presented in this paper. It exhibits all the desirable characteristics of compact genetic algorithm (cGA). While the selection strategy of cGA is similar to (steady-state) tournament selection with replacement (TSR), the proposed algorithm employs a strategy akin to tournament selection without replacement (TS/R). The latter is a common feature o...