yılları arasında Türkiye'de yayınlanan resimli çocuk kitaplarının içerik ve resimleme özelliklerinin incelenmesi bu araştırmanın problemini oluşturmaktadır. Araştırmada tarama-betimleyici yöntem kullanılmıştır. Araştırmanın kuramsal kısmı için kaynaklar taranıp, bilgiler derlenmiştir. 2000-2010 yılları arasında yayımlanan okul öncesi öykü kitaplarından oluşan 150 kitaba, hazırlanan kitap inceleme formu uygulanmıştır. Kitap inceleme formu ile kitapların fiziksel, resimleme, içerik ve karakter özellikleri incelenmiştir. Araştırmanın çalışma grubu uygun örnekleme yöntemi kullanılarak belirlenmiştir. Ankara ilinde bulunan çeşitli kitapevlerinden ve kütüphanelerden ulaşılan 2000-2010 yılları arasında Türkçe yayımlanmış okul öncesi döneme hitap eden 150 kitap çalışma grubunu oluşturmuştur. Resimleme özellikleri açısından incelenen kitapların daha çok; renkli, resim alanı bir çerçeve ile metinden ayrılmayan ve yalın hatlı resimleri olduğu belirlenmiştir. Resimli çocuk kitaplarında genel olarak yalın hatlı resimler tercih edilmiştir. Elde edilen bulgular ilgili alan yazın ışığında tartışılmıştır. Anahtar sözcükler: resimli kitaplar, karakter, resimleme, içerik, çocuk edebiyatı. ABSTRACT:In this respect, objective of the study consists of analysis of content and illustration features of children's picture books published in Turkey during the years 2000-2010. In the research, scan-descriptive method was used. For the theoretical part of the research, sources were scanned and information was compiled. Book review form was applied on 150 books consisting of preschool story books published during 2000-2010. Through the book review from, physical, illustration, content and character features of the books were examined. The study group of the research was determined using appropriate sampling method. The study group consisted of 150 books obtained from various bookstores and libraries located in Ankara, published during 2000-2010 in Turkish and which appeal to preschool study group. In terms of illustrating features, examined books were determined as to have mainly; colored, unframed and simple edge pictures. In children's picture books in general, simply edge pictures are preferred. The findings are discussed in the light of the relevant literature.

No abstract

Variable Neighborhood Search (VNS) is one of the most recent metaheuristics used for problem solving in which a systematic change of neighborhood within a local search is carried out. The idea is to build the best local search and shake operations based on neighbourhood structure available. In this paper, a modified version of VNS algorithm proposed for identical parallel machines scheduling problems with the objective function of minimizing makespan. The proposed VNS algorithm was tested 150 randomly generated problems with different jobs and machines. The results gained by modified VNS (MVNS) algorithm are presented and compared with the both Genetic Algorithm (GA) and Longest Processing Time (LPT) solutions. It is concluded that the MVNS algorithms outperform the both GA and LPT.Keywords: Identical Parallel Machine Scheduling; Makespan; Variable neighboorhood search 1. INTRODUCTION Identical parallel machines scheduling problems (PMS) with the objective function of minimizing makespan (C max ) is one of the best known and NP-hard [I] combinatorial problems. Thus, it is unlikely to obtain the optimal schedule through polynomial time-bounded algorithms. Small size instances of the PMS problem can be solved with reasonable computational time by exact algorithms such as branch-and-bound [2], and the cutting plane algorithm [3]. However, when the problem size increases, the computational time of exact methods grows exponentially. On the other hand heuristic algorithms have generally acceptable time and memory requirements, but do not guarantee optimality of the final solution, that is, a feasible solution is obtained which is likely to be either optimal or near optimal. The well-known longest processing time (LPT) rule of Graham [4] is part of family algorithm knows as list scheduling algorithm. The performance of LPT has been shown very well for the makespan single criteria problem [5]. Later, Coffinan et al. [6] proposed MULTIFIT algorithm that affords the relation between bin-packing and maximum completion time problems . Yue [7] show that the MULTIFIT heuristics is not guaranteed perform better than LPT for any given problem. Gupta and Ruiz-Torres [8] proposed a LISTFIT algorithm that combines the bin packing method used in the MULTIFIT heuristics with multiple lists ofjobs. Their computational results showed that the heuristic out-performs the LPT algorithm, and the MULTIFIT algorithm. Min and Cheng [9] proposed a genetic algorithm (GA) which based on machine code. They indicate that quality of GA's solution has advantage over heuristic procedure and Simulated

-Science journals are effective tools for supporting preschool children's learning and their science process skills. To that end, science journals can be described as a form of documentation providing opportunities for children to express their own ideas about the class discussions and phenomena they observed during inquirybased science events. The present study aims to reveal the opinions of teachers on science journals and determine their overall approach. This research is a qualitative study investigating the opinions of preschool teachers on science journals. The study group is consisted of 58 preschool teachers (57 females, 1 male) working at preschools/nursery classes from various regions across the country. Unstructured interview form, "Opinions of Preschool Teachers on Science Journals", prepared by the researchers was used as a data collection instrument.The present study employed the descriptive analysis technique, a qualitative research method, for the analysis of data collected. According to the results of the study, 29.3% of the preschool teachers presented their opinions on science journals as notebooks encouraging children's curiosity, 20.7% as infomercial notebooks, while 19% had no knowledge of science journals.

No abstract