There is a long time open problem regarding the generative power of scattered context grammars without erasing rules. This problem tries to compare their generative power with context-sensitive grammars. In this paper, modified version of this problem will be presented. This modified version combines scattered context grammars with another model — grammar systems. It will be shown that when con...

The South Oaks Gambling Screen (SOGS) was originally developed to screen for pathological gamblers in clinical settings, and its use has been expanded to other settings such as prevalence studies of pathological gambling in general populations. There are few studies of pathological gambling in Japan, except for the two studies on the development of the modified Japanese version of the SOGS. The...

Association rules identify associations among data items and were introduced in 1993 by Agarwal et al.. Most of the algorithms to find association rules deal with the static databases. There are very few algorithms that deal with dynamic databases. The most classical algorithm to find association rules in dynamic database is Borders algorithm. This paper presents two modified version of the Bor...