Categorization of pleasantness, harmony, dynamism and spaciousness by factor analysis also showed differences between the achromatic and chromatic schemes. The office with the chromatic scheme was found to be more pleasant, attractive, satisfying and dynamic than the one with the achromatic scheme, whereas the achromatic scheme was thought to be more formal and harmonious. In terms of accuracy and time spent performance scores measured significantly better in the room with the chromatic scheme than those in the room with the achromatic scheme. The findings show that chroma significantly affects performance and space appraisal. Sixty participants were assigned tasks and given a questionnaire to appraise the spatial color schemes. The research was conducted in a full-scale experimental room designed as a private office where achromatic and chromatic color schemes with coequal values were applied. 2016 4(2): 91 - 98.ĪKCAN U, AKYAR E, AKYAR H "SIERPINSKI ÇİZGELERİN OYUN KROMATİK VE OYUN RENK SAYILARI." Anadolu Üniversitesi Bilim ve Teknoloji Dergisi :B-Teorik Bilimler, 4, ss.91 - 98, 2016.This study explores the effects of chroma on participants' performance and environmental appraisal of an office. Anadolu Üniversitesi Bilim ve Teknoloji Dergisi :B-Teorik Bilimler. Anadolu Üniversitesi Bilim ve Teknoloji Dergisi :B-Teorik Bilimler, vol.4, no.2, 2016, ss.91 - 98.ĪKCAN U, AKYAR E, AKYAR H SIERPINSKI ÇİZGELERİN OYUN KROMATİK VE OYUN RENK SAYILARI. Anadolu Üniversitesi Bilim ve Teknoloji Dergisi :B-Teorik Bilimler 4, no.2 (2016): 91 - 98.ĪKCAN Ummahan, AKYAR EMRAH, AKYAR HANDAN SIERPINSKI ÇİZGELERİN OYUN KROMATİK VE OYUN RENK SAYILARI. Anadolu Üniversitesi Bilim ve Teknoloji Dergisi :B-Teorik Bilimler, 4(2), 91 - 98.ĪKCAN Ummahan,AKYAR EMRAH,AKYAR HANDAN SIERPINSKI ÇİZGELERİN OYUN KROMATİK VE OYUN RENK SAYILARI. SIERPINSKI ÇİZGELERİN OYUN KROMATİK VE OYUN RENK SAYILARI. Journal of Combinatorial Theory Series B 2008 98: 1-18.ĪKCAN U, AKYAR E, AKYAR H (2016). Refined activation strategy for the marking game. The game coloring number of planar graphs Journal of Combinatorial Theory Series B 75: 245-258. Lower bounds for the game colouring number of partial -trees and planar graphs Discrete Mathematics 2008 308: 2637-2642. The game chromatic number and the game colouring number of cactuses. Information Processing Letters 2009 : 1183-1186. International Journal of Pure and Applied Mathematics 2013 87: 855-862. Acyclic edge-coloring of Sierpinski-like graphs. On some metric properties of the Sierpinski graphs S(n, k). Taiwanese Journal of Mathematics 2008 12: 513-522. Coloring Sierpinski graphs and Sierpinski gasket graphs. Czechoslovak Mathematical Journal 1997 47: 95-104. Graphs S(n, k) and a variant of the Tower of Hanoi problem. Journal of Combinatorial Theory Series B 2000 78: 57-68. A simple competitive graph coloring algorithm. Planar graph coloring with an uncooperative partner. Vertex-, edge-, and total-colorings of Sierpinski-like graphs. Game chromatic number of outerplanar graphs. On the game chromatic number of some classes of graphs.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |