Yayın tarihi için Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering listeleme
Toplam kayıt 188, listelenen: 21-40
-
The routine design-modular distributed modeling platform for distributed routine design and simulation-based testing of distributed assemblies
(Cambridge University Press, 2008-12-12)In this paper we describe a conceptual framework and implementation of a tool that supports task-directed, distributed routine design (RD) augmented with simulation-based design testing. In our research, we leverage the ... -
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 ... -
A robust biclustering method based on crossing minimization in bipartite graphs
(Springer-Verlag Berlin, 2009)[No abstract available] -
Calculating the VC-dimension of decision trees
(IEEE, 2009)We 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 ... -
Fully decentralized, collaborative multilateration primitives for uniquely localizing WSNs
(Springer-Verlag Berlin, 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 ... -
Integrating vendors into cooperative design practices
(Taylor & Francis Ltd, 2009)This paper describes a new approach to cooperative design using distributed, off-the-shelf design components. The ultimate goal is to enable assemblers to rapidly design their products and perform simulations using parts ... -
Biclustering expression data based on expanding localized substructures
(Springer-Verlag Berlin Heidelberg, 2009)Biclustering gene expression data is the problem of extracting submatrices of genes and conditions exhibiting significant correlation across both the rows and the columns of a data matrix of expression values. We provide ... -
Algebraic break of a cryptosystem based on discretized two-dimensional chaotic maps
(Elsevier Science BV, 2009-03-30)Recently, a cryptosystem based on two-dimensional discretized chaotic maps was proposed [T. Xiang, et al., Phys. Lett. A 364 (2007) 252]. In this Letter, we cryptanalyze the proposal using algebraic methods. We give three ... -
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 ... -
Incremental construction of classifier and discriminant ensembles
(Elsevier Science Inc, 2009-04-15)We discuss approaches to incrementally construct an ensemble. The first constructs an ensemble of classifiers choosing a subset from a larger set, and the second constructs an ensemble of discriminants, where a classifier ... -
Comment on "Modified Baptista type chaotic cryptosystem via matrix secret key" [Phys. Lett. A 372 (2008) 5427]
(Elsevier Science BV, 2009-09-07)In this comment, we analyze a recently proposed Baptista-like 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 ... -
A robust localization framework to handle noisy measurements in wireless sensor networks
(IEEE, 2009-09-14)We construct a robust localization framework to handle noisy measurements in wireless sensor networks. Traditionally many approaches employ the distance information gathered from ranging devices of the sensor nodes to ... -
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 ... -
An incremental model selection algorithm based on cross-validation for finding the architecture of a Hidden Markov model on hand gesture data sets
(IEEE, 2009-12-13)In a multi-parameter learning problem, besides choosing the architecture of the learner, there is the problem of finding the optimal parameters to get maximum performance. When the number of parameters to be tuned increases, ... -
Fully decentralized and collaborative multilateration primitives for uniquely localizing WSNs
(Springer International Publishing AG, 2010)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 ... -
Feature extraction from discrete attributes
(IEEE, 2010)In many pattern recognition applications, first decision trees are used due to their simplicity and easily interpretable nature. In this paper, we extract new features by combining k discrete attributes, where for each ... -
Univariate margin tree
(Springer, 2010)In many pattern recognition applications, first decision trees are used due to their simplicity and easily interpretable nature. In this paper, we propose a new decision tree learning algorithm called univariate margin ... -
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 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 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 ...