2 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 2 / 2
Yayın The recurrence of an Indian dream, Magic Seeds(Cyprus International University, 2021) Edman, Timuçin Buğra; Boynukara, Hasan; Gözen, HacerMagic Seeds is a work of fiction, but it also serves as a reflection of the real world, the history of India, where value judgments in a society return to their starting point only by reforming in accordance with the reconstruction of a given society. Willie, who is in search of identity and a home, finds the remedy in joining the guerrilla order. However, here, he fights through the shadow of the past, which he can never escape. The shadow of the past is the hierarchy itself, and this article explores the never-ending transformation of hierarchy, anarchism, and the search for order through the novel Magic Seeds. This article is a comparative study of the novel Magic Seeds, and history, the Naxalite movement in India from the 1960s until the early 2000s. Through the historical revolutionary Naxalite movement and a political association of the Marxist–Leninist Communist Party of India in West Bengal in 1960s, this study also reveals why an anarchic movement apparently returns to its starting point, and legs behind the decolonization or reconstruction of a society due to the deep-rooted and pre-structured hierarchy in a society by considering the terms humanization, dehumanization, hierarchy, cast system, anarchism, transformation and reconstruction.Yayın Hierarchical quantization indexing for wavelet and wavelet packet image coding(Elsevier Science BV, 2010-02) Ateş, Hasan Fehmi; Tamer, EnginIn this paper, we introduce the quantization index hierarchy, which is used for efficient coding of quantized wavelet and wavelet packet coefficients. A hierarchical classification map is defined in each wavelet subband, which describes the quantized data through a series of index classes. Going from bottom to the top of the tree, neighboring coefficients are combined to form classes that represent some statistics of the quantization indices of these coefficients. Higher levels of the tree are constructed iteratively by repeating this class assignment to partition the coefficients into larger Subsets. The class assignments are optimized using a rate-distortion cost analysis. The optimized tree is coded hierarchically from top to bottom by coding the class membership information at each level of the tree. Context-adaptive arithmetic coding is used to improve coding efficiency. The developed algorithm produces PSNR results that are better than the state-of-art wavelet-based and wavelet packet-based coders in literature.
