Bilgisayar Mühendisliği Bölümü Koleksiyonu

Permanent URI for this collectionhttps://gcris.khas.edu.tr/handle/20.500.12469/45

Browse

Browsing Bilgisayar Mühendisliği Bölümü Koleksiyonu by WoS Q "Q3"

Filter results by typing the first few letters
Now showing 1 - 3 of 3
  • Thumbnail Image
    Conference Object
    Citation Count: 2
    Cosmic ray intensity variation during a CME
    (Pergamon-Elsevier Science Ltd, 2002) Kandemir, Gulcın; Geçkinli, Melih; Fırat, Coşkun; Yılmaz, Melek; Özuğur, B
    The June 6 2000 coronal mass ejection was an exceptional full halo which made it possible to measure cosmic ray (CR) decrease with a simple experimental set-up. Variation in the local secondary cosmic ray density has been investigated by means of gamma rays. The experiment site was located in Istanbul (41.1N 29.0E). CR electrons and slow gamma rays have been eliminated. The CR density has dropped drastically starting on June 8 2000. The counts have been compared with the pre-shock levels and some other cases of CMEs. During strong solar modulation the local counts of secondary CR intensity values dropped down as much as 24%. (C) 2002 Elsevier Science Ltd. All rights reserved.
  • Thumbnail Image
    Article
    Citation Count: 1
    Orthogonal projection and liftings of Hamilton-decomposable Cayley graphs on abelian groups
    (Elsevier Science Bv, 2013) Çalışkan, Cafer; Çalışkan, Cafer; Kreher, Donald L.
    In this article we introduce the concept of (p alpha)-switching trees and use it to provide sufficient conditions on the abelian groups G and H for when CAY (G x H
  • Thumbnail Image
    Article
    Citation Count: 5
    Three-fast-searchable graphs
    (Elsevier Science Bv, 2013) Dereniowski, Dariusz; Diner, Öznur Yaşar; Dyer, Danny
    In the edge searching problem searchers move from vertex to vertex in a graph to capture an invisible fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which at every move a new edge of the graph G must be guaranteed to be free of the intruder. That is once all searchers are placed the graph G is cleared in exactly vertical bar E(G)vertical bar moves. Such a restriction obviously necessitates a larger number of searchers. We examine this model and characterize graphs for which 2 or 3 searchers are sufficient. We prove that the corresponding decision problem is NP-complete. (C) 2013 Elsevier B.V. All rights reserved.