Başlık için Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering listeleme
Toplam kayıt 188, listelenen: 43-62
-
Crossing minimization in weighted bipartite graphs
(Springer, 2007)Given a bipartite graph G = (L-0, L-1, E) and a fixed ordering of the nodes in L-0, the problem of finding an ordering of the nodes in L-1 that minimizes the number of crossings has received much attention in literature. ... -
Crossing minimization in weighted bipartite graphs
(Elsevier B.V., 2009-12)Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has received much attention in literature. The ... -
Cryptanalysis of a chaos-based image encryption algorithm
(Elsevier Science BV, 2009-03-30)A chaos-based image encryption algorithm was proposed in [Z.-H. Guan, F. Huang, W. Guan, Phys. Lett. A 346 (2005) 153]. In this Letter, we analyze the security weaknesses of the proposal. By applying chosen-plaintext and ... -
Cryptanalysis of a cryptosystem based on discretized two-dimensional chaotic maps
(Elsevier Science BV, 2008-11-17)Recently, an encryption algorithm based on two-dimensional discretized chaotic maps was proposed [Xiang et al., Phys. Lett. A 364 (2007) 252]. In this Letter, we analyze the security weaknesses of the proposal. Using the ... -
Cryptanalysis of a multi-chaotic systems based image cryptosystem
(Elsevier Science BV, 2010-01-15)This paper is a cryptanalysis of a recently proposed multi-chaotic systems based image cryptosystem. The cryptosystem is composed of two shuffling stages parameterized by chaotically generated sequences. We propose and ... -
Cryptanalysis of a new substitution-diffusion based image cipher
(Elsevier Science BV, 2010-07)This paper introduces two different types of attacks on a recently proposed cryptosystem based on chaotic standard and logistic maps. In the two attacks, only a pair of (plaintext/ciphertext) was needed to totally break ... -
Cryptanalysis of Fridrich's chaotic image encryption
(World Scientific Publishing, 2010-05)We cryptanalyze Fridrich's chaotic image encryption algorithm. We show that the algebraic weaknesses of the algorithm make it vulnerable against chosen-ciphertext attacks. We propose an attack that reveals the secret ... -
Cryptanalysis of image encryption with compound chaotic sequence
(IEEE, 2009)Recently, an image encryption algorithm based on compound chaotic sequence was proposed [Tong et al., Image and Vision Computing 26 (2008) 843]. In this paper, we analyze the security weaknesses of the proposal. We give ... -
Çizge evrişim ağı kullanarak patojen-konak ağlarında protein etkileşim tahmini
(IEEE, 2021-06-09)Proteinler yaşamsal faaliyetlerin gerçekleşmesinde kritik rol oynayan biyolojik moleküllerdir. Konak canlı proteinleri ile patojen proteinleri arasındaki etkileşimler patojenkonak etkileşim (PHI) ağlarını oluşturmaktadır. ... -
Demo abstract: TeleHealth - Intelligent healthcare with M2M communication module
(ACM, 2012-11-06)Chronic diseases, such as diabetes, heart disease (e.g. arrhythmia and hypertension), chronic respiratory diseases (e.g. asthma and COPD), are by far the leading cause of mortality in the world, representing 63% of all ... -
Design and analysis of classifier learning experiments in bioinformatics: survey and case studies
(IEEE Computer Soc, 2012-12)In many bioinformatics applications, it is important to assess and compare the performances of algorithms trained from data, to be able to draw conclusions unaffected by chance and are therefore significant. Both the design ... -
Design of real-time VBR traffic shaping schemes by considering the impact of both buffer overflows and deadline violations
(Int Inst Informatics & Systemics, 2005)While smoothing the traffic of time sensitive applications at the user premises can reduce the losses due to buffer overflows within the network, it may have an adverse effect on the losses due to the deadline violations ... -
A designing practice and two coding practices for extreme programming (XP)
(Springer Verlag, 2003)This paper introduces three new XP practices and reports the experience of applying them to web based software development. These are issue- based programming, comment-first coding and just in time code ownership. The ... -
Detection of DHCP starvation attacks in software defined networks: a case study
(IEEE, 2018-12-06)Software Defined Networking (SDN) is an emerging concept that maintains and analyzes the network status with its centralized architecture. This facility ensures network operators to monitor and manage the network elements ... -
Do?rudan pazarlama amaçlı hedef kitle analizi
(Institute of Electrical and Electronics Engineers Inc., 2018-07-05)Doğrudan pazarlama, uygun ürünleri uygun kişilerle en kısa yoldan buluşturma sürecidir. Son yılların en popüler pazarlama yaklaşımlarından birisidir. Bu çalışmada turizm sektörüne ait isimsizleştirilmiş bir veri tabanını ... -
Driver recognition using gaussian mixture models and decision fusion techniques
(Springer-Verlag Berlin, 2008)In this paper we present our research in driver recognition. The goal of this study is to investigate the performance of different classifier fusion techniques in a driver recognition scenario. We are using solely driving ... -
E-learning and microformats: A learning object harvesting model and a sample application
(2008)In order to support interoperability of learning tools and reusability of resources, this paper introduces a framework for harvesting learning objects from web-based content. Therefore, commonly-known web technologies are ... -
Efficient privacy-aware record integration
(2013)The integration of information dispersed among multiple repositories is a crucial step for accurate data analysis in various domains. In support of this goal, it is critical to devise procedures for identifying similar ... -
Eigenclassifiers for combining correlated classifiers
(Elsevier Science Inc, 2012-03-15)In practice, classifiers in an ensemble are not independent. This paper is the continuation of our previous work on ensemble subset selection [A. Ulas, M. Semerci, O.T. Yildiz, E. Alpaydin, Incremental construction of ...
