Browsing MF  Makale Koleksiyonu  Bilgisayar Mühendisliği Bölümü / Department of Computer Science by Title
Now showing items 423 of 48

Breaking an orbitbased symmetric cryptosystem
(PergamonElsevier Science LTD, 201109)We report a break for a recently proposed class of cryptosystems. The cryptosystem uses constant points of a periodic secret orbit to encrypt the plaintext. In order to break the system, it suffices to sort the constant ... 
Colored simultaneous geometric embeddings and universal pointsets
(SPRINGER, 2011)Universal pointsets can be used for visualizing multiple relationships on the same set of objects or for visualizing dynamic graph processes. In simultaneous geometric embeddings, the same point in the plane is used to ... 
Comment on "Encryption and decryption of images with chaotic map lattices" [Chaos 16, 033118 (2006)]
(AMER INST PHYSICS, CIRCULATION & FULFILLMENT DIV, 200809)In this paper, we comment on the chaotic encryption algorithm proposed by A. N. Pisarchik et al. [Chaos 16, 033118 (2006)]. We demonstrate that the algorithm is not invertible. We suggest simple modifications that can ... 
Comment on "Modified Baptista type chaotic cryptosystem via matrix secret key" [Phys. Lett. A 372 (2008) 5427]
(ELSEVIER SCIENCE BV, 20090907)In this comment, we analyze a recently proposed Baptistalike cryptosystem and show that it is not invertible. Others weaknesses are also reported. A modified version of this cryptosystem is proposed to show how to overcome ... 
Constructing a WordNet for Turkish using manual and automatic annotation
(Assoc Computing Machinery, 201805)In this article, we summarize the methodology and the results of our 2yearlong efforts to construct a comprehensive WordNet for Turkish. In our approach, we mine a dictionary for synonym candidate pairs and manually mark ... 
Construction of a Turkish proposition bank
(Tubitak Scientific & Technical Research Council, 2018)This paper describes our approach to developing the Turkish PropBank by adopting the semantic rolelabeling guidelines of the original PropBank and using the translation of the English PennTreeBank as a resource. We discuss ... 
Costconscious comparison of supervised learning algorithms over multiple data sets
(ELSEVIER SCI LTD, 201204)In the literature, there exist statistical tests to compare supervised learning algorithms on multiple data sets in terms of accuracy but they do not always generate an ordering. We propose Multi(2)Test, a generalization ... 
Cryptanalysis of a chaosbased image encryption algorithm
(ELSEVIER SCIENCE BV, 20090330)A chaosbased 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 chosenplaintext and ... 
Cryptanalysis of a cryptosystem based on discretized twodimensional chaotic maps
(ELSEVIER SCIENCE BV, 20081117)Recently, an encryption algorithm based on twodimensional 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 multichaotic systems based image cryptosystem
(ELSEVIER SCIENCE BV, 20100115)This paper is a cryptanalysis of a recently proposed multichaotic systems based image cryptosystem. The cryptosystem is composed of two shuffling stages parameterized by chaotically generated sequences. We propose and ... 
Cryptanalysis of a new substitutiondiffusion based image cipher
(ELSEVIER SCIENCE BV, 201007)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 PUBL CO PTE LTD, 201005)We cryptanalyze Fridrich's chaotic image encryption algorithm. We show that the algebraic weaknesses of the algorithm make it vulnerable against chosenciphertext 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 ... 
Design and analysis of classifier learning experiments in bioinformatics: survey and case studies
(IEEE COMPUTER SOC, 201212)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 ... 
Eigenclassifiers for combining correlated classifiers
(ELSEVIER SCIENCE INC, 20120315)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 ... 
Facial expression recognition based on anatomy
(Academic Press INC Elsevier Science, 201402)In this study, we propose a novel approach to facial expression recognition that capitalizes on the anatomical structure of the human face. We model human face with a highpolygon wireframe model that embeds all major ... 
Factored particle filtering with dependent and constrained partition dynamics for tracking deformable objects
(SPRINGER, 201410)In particle filtering, dimensionality of the state space can be reduced by tracking control (or feature) points as independent objects, which are traditionally named as partitions. Two critical decisions have to be made ... 
A factorized high dimensional model representation on the nodes of a finite hyperprismatic regular grid
(Elsevier Science inc, 200505)When the values of a multivariate function f(x(1),...,x(N)), having N independent variables like x(1),...,x(N) are given at the nodes of a cartesian, product set in the space of the independent variables and ail interpolation ... 
ForceDirected Approaches to Sensor Localization
(ASSOC COMPUTING MACHINERY, 201009)As the number of applications of sensor networks increases, so does the interest in sensor network localization, that is, in recovering the correct position of each node in a network of sensors from partial connectivity ... 
Fully Decentralized and Collaborative Multilateration Primitives for Uniquely Localizing WSNs
(SPRINGER INTERNATIONAL PUBLISHING AG, 2009)We provide primitives for uniquely localizing WSN nodes. The goal is to maximize the number of uniquely localized nodes assuming a fully decentralized model of computation. Each node constructs a cluster of its own and ...