9 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 9 / 9
Yayın Calculating the VC-dimension of decision trees(IEEE, 2009) Aslan, Özlem; Yıldız, Olcay Taner; Alpaydın, Ahmet İbrahim EthemWe propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree with binary features depends on (i) the VC-dimension values of the left and right subtrees, (ii) the number of inputs, and (iii) the number of nodes in the tree. From a training set of example trees whose VC-dimensions are calculated by exhaustive search, we fit a general regressor to estimate the VC-dimension of any binary tree. These VC-dimension estimates are then used to get VC-generalization bounds for complexity control using SRM in decision trees, i.e., pruning. Our simulation results shows that SRM-pruning using the estimated VC-dimensions finds trees that are as accurate as those pruned using cross-validation.Yayın Sperm morphology analysis with CNN based algorithms(IEEE Computer Society, 2014-08-29) Şavkay, Osman Levent; Cesur, Evren; Yalçın, Müştak Erhan; Tavşanoğlu, Ahmet VedatIn this paper Morphological Analysis part of our proposed computer-aided sperm analysis system (CASA) is simulated and the results beside the algorithm steps are presented. The morphology analysis is simply dealing with shape of the sperms and extracting the shape characteristics in medical parameters. The characteristics are obtained by image processing algorithms which utilizes Cellular Nanoscale Network (CNN) based and spatial image processing blocks. The following calculation of medical parameters are obtained from the outputs of image processing blocks. The algorithm is so designed to adapt the final SoC architecture such as Xilinx Zynq7000 device.Yayın Optimal power allocation in NOMA systems with imperfect channel estimation(IEEE, 2017) Şenel, Kamil; Tekinay, ŞirinNon-orthogonal multiple access is a promising technology for the fifth generation systems which exploits the power domain to achieve higher spectral efficiency. The performance of NOMA techniques are usually investigated under an ideal setup with perfect successive interference cancellation. However, the limitations of NOMA techniques under a setup with imperfect successive interference cancellation are not well understood. Contrary to the approaches in the literature, we examine the performance of NOMA under a non-ideal setup and propose two power allocation algorithms. The first algorithm is designed for the max-min problem whereas the second algorithm considers the heterogeneous rate requirements of users and provides solutions based on a novel rate measure. The performance of the algorithms is investigated both theoretically and numerically under a non-ideal setup with channel estimation errors. The theoretical analyses reveal that the algorithms achieve the optimum power allocation for the rate max-min problems. The numerical analyses are not only in agreement with the theoretical analyses, but also show the superiority of the proposed algorithms compared to both the conventional multiple access techniques as well as other NOMA approaches.Yayın Algoritmik kaynaşım yöntemiyle plaka tanıma sistemlerinin performansının artırılması(2011) Tamer, Engin; Çizmeci, BurakBu bildiride, bilgisayarlı görü ve örüntü tanıma alanlarında çok önemli bir yeri olan plaka tanıma sistemlerinin performansını artırmak amacıyla algoritmik kaynaşım yöntemini önermekteyiz. Plaka tanıma sistemleri genellikle plakanın yerinin saptanması, karakter bölütleme ve karakter tanıma şeklinde uç kısımdan oluşur. Karakter bölütleme ve tanıma, görüntü işleme ve örüntü tanıma alanlarında yoğun bir şekilde çalışılmış ve bu problemlerin çözümünde gürbüz sistemler tasarlanmıştır. Ancak plaka tanıma sistemlerinin en temel problemi plaka yerinin tam piksel hassasiyetle saptanmasıdır. Plaka yerinin saptanması için bir önceki çalışmamızda yatay tarama yöntemini önermiştik. Bu bildiride çift satırlı plakaları da okuyabilen dörtgen saptamaya dayalı farklı bir algoritma geliştirdik. Plaka yerinin saptanmasını gürbüz hale getirebilmek için iki farklı algoritmanın başarımlarını algoritmik kaynaşım çatısı ile birleştiren yeni bir yaklaşım sunmaktayız. Gerçekleştirilen benzetimlerde önerilen algoritmik kaynaşım yöntemi ile plaka tanıma sisteminin performansında önemli artışlar gözlemlenmiştir.Yayın A new approach for named entity recognition(IEEE, 2017) Ertopçu, Burak; Kanburoğlu, Ali Buğra; Topsakal, Ozan; Açıkgöz, Onur; Gürkan, Ali Tunca; Özenç, Berke; Çam, İlker; Avar, Begüm; Ercan, Gökhan; Yıldız, Olcay TanerMany sentences create certain impressions on people. These impressions help the reader to have an insight about the sentence via some entities. In NLP, this process corresponds to Named Entity Recognition (NER). NLP algorithms can trace a lot of entities in the sentence like person, location, date, time or money. One of the major problems in these operations are confusions about whether the word denotes the name of a person, a location or an organisation, or whether an integer stands for a date, time or money. In this study, we design a new model for NER algorithms. We train this model in our predefined dataset and compare the results with other models. In the end we get considerable outcomes in a dataset containing 1400 sentences.Yayın SPD (Static Priority with Deadline considerations) packet scheduling algorithm for achieving better QoS(IEEE, 2007) Dağ, TamerProviding quality of service (QoS) to applications with different traffic characteristics based on their needs is an important research area for today's and tomorrow's high speed networks. Various techniques have been proposed to achieve good QoS for diverse application types. Among these techniques, packet scheduling algorithms decide on how to process packets at network nodes; however they have limited support for better QoS. In order to supply the various QoS requirements for different kinds of applications, new scheduling policies need to be developed and evaluated. This paper proposes a new kind of packet scheduling algorithm, Static Priority with Deadline Considerations (SPD), which integrates an important QoS parameter (the delay) into the classical static priority packet scheduling algorithm and analyses the packet losses by considering the two different components of losses; buffer overflows and deadline violations. The proposed algorithm not only reduces the complexity of the static priority algorithm by introducing degree sorting but also solves the starving problem and provides fairness to applications with different priorities.Yayın An efficient ECG data compression technique based on predefined signature and envelope vector banks(IEEE, 2005) Gürkan, Hakan; Güz, Ümit; Yarman, Bekir Sıddık BinboğaIn this paper, a new method to compress ElectroCardioGram (ECG) Signal by means of "Predefined Signature and Envelope Vector Banks-PSEVB" is presented. In this work, on a frame basis, any ECG signal is modeled by multiplying three parameters as called the Predefined Signature Vector, Predefined Envelope Vector, and Frame-Scaling Coefficient. It has been demonstrated that the predefined signature vectors and predefined envelope vectors constitute a "PSEVB" to describe any measured ECG signal. In this case, ECG signal for each frame is described in terms of the two indices "R" and "K" of PSEVB and the frame-scaling coefficient. The new compression method achieve good compression ratios with low level reconstruction error while preserving diagnostic information in the reconstructed ECG signal. Furthermore, once PSEVB are stored on each communication node, transmission of ECG signals reduces to the transmission of indexes "R" and "K" of PSEVB and the frame-scaling coefficient which also result in considerable saving in the transmission band.Yayın Microwave amplifier design for mobile communication via immittance data modelling(IEEE, 2003) Kılınç, Ali; Pınarbaşı, Hacı; Yarman, Bekir Sıddık Binboğa; Aksen, AhmetIn this paper, a practical broadband microwave amplifier design algorithm based on immittance data modelling is presented. In the course of design, first, the optimum input and output terminations for the active device are produced employing the real frequency technique. Then, these terminations are modelled utilizing the new immittance-modeling tool to synthesize the front-end and back-end matching networks. An example is included to exhibit the implementation of the proposed design algorithm to construct a single stage wideband microwave amplifier over a wide frequency band. It is expected that the proposed design algorithm will find applications in the design of microwave amplifiers put on MMIC for mobile communication.Yayın Gerçel ve karmaşık süzgeç öbeklerinin eşdalgacıklı tasarımı(IEEE, 2006-07-31) Ateş, Hasan Fehmi; Orchard, Michael T.; Kanberoğlu, BerkayBu bildiride, eşdalgacıklı tam geri çatma süzgeç öbekleri tasarlamak için, Parks-McClellan algoritması gibi tekniklerle üretilen enküçük-enbüyük optimal eşdalgacıklı kısıtsız süzgeçleri eşlemlemede kullanılan basit bir yöntem sunulmaktadır. Bu yöntem, hem standart alçak- ve yüksek geçiren süzgeçlerin tam geri çatması sağlayacak şekilde tasarımlarına hem de kritik örneklenmiş karmaşık süzgeçlerin tasarımlarına uygulanmıştır. Gerçel süzgeç öbeği tasarımı için, yöntemimiz, tam geri çatma kısıtlarını karşılayan ve aynı zamanda standart enküçük-enbüyük süzgeç tasarımı ölçütlerini eniyileyen eşdalgacıklı alçak ve yüksek geçiren süzgeçleri üretmektedir. Karmaşık süzgeç öbeği tasarımı için, yöntemimiz, tam geri çatmaya izin verirken aynı zamanda rezone eden sinyaller için kritik örneklenmiş bir zarf/faz gösterimi oluşturmaktadır. Karmaşık süzgecin genlik tepkisi, ideal pozitif bir frekans geçirme kuşağının eşdalgacıklı yaklaşımıdır. Faz tepkisi ise salt doğrusal fazın eşdalgacıklı yaklaşımıdır.
