Browsing Bilgisayar Mühendisliği / Computer Engineering by KHAS Author "Çalışkan, Cafer"
Now showing items 1-6 of 6
-
An analysis for the use of compressed sensing method in microwave imaging [Mikrodalga Görüntülemede Sıkıştırılmış Algılama Yönteminin Kullanımına Yönelik Bir Analiz]
Authors:
Publisher and Date:(Institute of Electrical and Electronics Engineers Inc., 2017)One of the most important problems encountered in microwave imaging methods is intensive data processing traffic that occurs when high resolution and real time tracking is desired. Radar signals can be recovered without loss of data with a randomly selected subset of the measurement data by compression sensing (CS) method which has been popular in recent years. For this reason in this study the use and capabilities of the CS method were investigated for tracking moving human and the target information ...
-
An Analysis for the Use of Compressed Sensing Method in Microwave Imaging
Authors:
Publisher and Date:(IEEE, 2017)One of the most important problems encountered in microwave imaging methods is intensive data processing traffic that occurs when high resolution and real time tracking is desired. Radar signals can be recovered without loss of data with a randomly selected subset of the measurement data by compression sensing (CS) method which has been popular in recent years. For this reason, in this study, the use and capabilities of the CS method were investigated for tracking moving human, and the target ...
-
New 2-Edge-Balanced Graphs from Bipartite Graphs
Authors:
Publisher and Date:(Wiley-Blackwell, 2016)Let G be a graph of order n satisfying that there exists lambda epsilon Z(+) for which every graph of order n and size t is contained in exactly. distinct subgraphs of the complete graph K-n isomorphic to G. Then G is called t-edge-balanced and. the index of G. In this article new examples of 2-edge-balanced graphs are constructed from bipartite graphs and some further methods are introduced to obtain more from old. (C) 2015 Wiley Periodicals Inc.
-
New Infinite Families of 2-Edge-Balanced Graphs
Authors:
Publisher and Date:(Wiley-Blackwell, 2014)A graph G of order n is called t-edge-balanced if G satisfies the property that there exists a positive for which every graph of order n and size t is contained in exactly distinct subgraphs of Kn isomorphic to G. We call the index of G. In this article we obtain new infinite families of 2-edge-balanced graphs.
-
Orthogonal projection and liftings of Hamilton-decomposable Cayley graphs on abelian groups
Authors:
Publisher and Date:(Elsevier Science Bv, 2013)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
-
Partitioning 3-arcs into Steiner Triple Systems
Authors:
Publisher and Date:(Wiley, 2017)In this article it is shown that there is a partitioning of the set of 3-arcs in a projective plane of order three into nine pairwise disjoint Steiner triple systems of order 13.
