Sejarah Kedah Dua Millenia mengandungi sembilan bab yang membincangkan tentang sejarah negeri Kedah Darul Aman dari setiap aspek. Ia merangkumi aspek kesultanan, pentadbiran, ekonomi, pendidikan dan lain-lain dari zaman tradisi hingga kini. Penghasilan buku ini juga di harapkan dapat memberi kesedaran kepada setiap golongan masyarakat di Malaysia tentang sejarah negeri Kedah Darul Aman dengan lebih jelas. Pemahaman tersebut sangat penting bagi melahirkan rasa syukur dan terima kasih terhadap semua nikmatyang diperoleh sebagai rakyat Malaysia khususnya rakyat negeri Kedah Darul Aman. Buku ini juga mampu mengisi keperluan para pembaca dalam usaha mengetahui sejarah negeri Kedah dengan mendalam. Diharapkan dengan penghasilan buku ini, sejarah negeri Kedah Darul Aman terus tersemat tanpa dilupai oleh generasi akan datang.
Sejarah Kedah Dua Millenia mengandungi sembilan bab yang membincangkan tentang sejarah negeri Kedah Darul Aman dari setiap aspek.
Ar Rasfa is a Middle Paleolithic open-air site located in the Rift Valley of Northwest Jordan excavated between 1997-1999. This book presents a detailed technological, typological, and palaeoanthropological analysis of the stone tool assemblage from Ar Rasfa. Artefacts reflecting the initial preparation and exploitation of local flint sources dominate the Ar Rasfa assemblage. Typologically, the assemblage is most similar to Levantine Mousterian assemblages such as those from Naamé, Skhul and Qafzeh. Patterns of lithic variability and contextual evidence suggest Ar Rasfa was visited intermittently by human populations circulating between lake/river-edge resources in the Rift Valley bottom and woodland habitats along the ridge of the Transjordan Plateau.
This book presents a detailed technological, typological, and paleoanthropological analysis of the stone tool assemblage from Ar Rasfa.
We consider Gray codes and efficient exhaustive generating algorithms for the sets belonging to three major classes of restricted words, that are: (1) restricted growth sequences, (2) factor avoiding q-ary words, and (3) pattern avoiding permutations. For the first two classes, our Gray codes (and thus, our generating algorithms) are based on order relations obtained by specializing known order relations; namely Reflected Gray Code (RGC) order and its variations, and we call them Reflected Gray Code based orders. The Gray code and the generating algorithm for the third class are based on Steinhaus-Johnson-Trotter order, that is, order relation induced by Steinhaus-Johnson-Trotter Gray code for permutations. In the first results, we define Gray codes and give efficient generating algorithms for the class of restricted growth sequences that satisfy our prescribed properties. In particular, we focus on four mainstream subclasses: subexcedant and ascent sequences, restricted growth functions and staircase words. The results are given in two parts: by using original RGC order and Co-RGC order, which generates prefix (and suffix, respectively) partitioned Gray codes; and we give comparison between the two results. In addition, we investigate the Graycodeness of the restricted ascent sequences.In the second results, we define Gray codes and give an efficient generating algorithm for the class of factor avoiding q-ary words. Among the involved tools, we make use of original RGC order for even q and Dual RGC order for odd q, the zero periodicity property, and word matching techniques adapted from that of Knuth-Morris-Pratt. We give the implementation of these results to define Gray code and generating algorithm for cross-bifix-free sets.In the third results, we define Gray codes and give efficient generating algorithms for the class of pattern avoiding permutations. In particular, we show that the Steinhaus-Johnson-Trotter Gray code for permutations, when restricted by avoiding some set of patterns, still remains a (possibly less restricted) Gray code. The main ingredients we are using in the investigation of the Graycodeness are: succession functions, the classical bijection from inversion tables to permutations, and the list of inversion tables with respect to RGC order. We give additional results on graph theoretic consequences.
We consider Gray codes and efficient exhaustive generating algorithms for the sets belonging to three major classes of restricted words, that are: (1) restricted growth sequences, (2) factor avoiding q-ary words, and (3) pattern avoiding ...
