Toplam kayıt 45, listelenen: 1-20

  • A factorized high dimensional model representation on the nodes of a finite hyperprismatic regular grid 

    Tunga, Mehmet Alper; Demiralp, Metin (Elsevier Science inc, 2005-05)
    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 ...
  • Hybrid high dimensional model representation (HHDMR) on the partitioned data 

    Tunga, Mehmet Alper; Demiralp, Metin (Elsevier B.V, 2006)
    A multivariate interpolation problem is generally constructed for appropriate determination of a multivariate function whose values are given at a finite number of nodes of a multivariate grid. One way to construct the ...
  • Parallel univariate decision trees 

    Yıldız, Olcay Taner; Dikmen, Onur (Elsevier B.V, 2007-05-01)
    Univariate decision tree algorithms are widely used in data mining because (i) they are easy to learn (ii) when trained they can be expressed in rule based manner. In several applications mainly including data mining, the ...
  • The routine design-modular distributed modeling platform for distributed routine design and simulation-based testing of distributed assemblies 

    Eskil, Mustafa Taner; Sticklen, Jon; Radcliffe, Clark (CAMBRIDGE UNIV PRESS, 2008-01)
    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 ...
  • Comment on "Encryption and decryption of images with chaotic map lattices" [Chaos 16, 033118 (2006)] 

    Solak, Ercan; Çolak, Cahit (AMER INST PHYSICS, CIRCULATION & FULFILLMENT DIV, 2008-09)
    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 ...
  • Cryptanalysis of a cryptosystem based on discretized two-dimensional chaotic maps 

    Solak, Ercan; Çolak, Cahit (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 ...
  • Integrating vendors into cooperative design practices 

    Eskil, Mustafa Taner; Sticklen, Jon (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 ...
  • Cryptanalysis of image encryption with compound chaotic sequence 

    Solak, Ercan (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 ...
  • Algebraic break of a cryptosystem based on discretized two-dimensional chaotic maps 

    Solak, Ercan; Çokal, Cahit (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 

    Çokal, Cahit; Solak, Ercan (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 

    Ulaş, Aydın; Semerci, Murat; Yıldız, Olcay Taner; Alpaydın, Ahmet İbrahim Ethem (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] 

    Rhouma, Rhouma; Solak, Ercan; Arroyo, David; Li, Shujun; Alvarez, Gonzalo; Belghith, Safya Mdimegh (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 ...
  • Fully Decentralized and Collaborative Multilateration Primitives for Uniquely Localizing WSNs 

    Çakıroğlu, Arda; Erten, Cesim (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 ...
  • Cryptanalysis of a multi-chaotic systems based image cryptosystem 

    Solak, Ercan; Rhouma, Rhouma; Belghith, Safya Mdimegh (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 

    Solak, Ercan; Çokal, Cahit; Yıldız, Olcay Taner; Bıyıkoğlu, Türker (WORLD SCIENTIFIC PUBL CO PTE LTD, 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 

    Rhouma, Rhouma; Solak, Ercan; Belghith, Safya Mdimegh (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 ...
  • Force-Directed Approaches to Sensor Localization 

    Efrat, Alon; Forrester, David; Iyer, Anand; Kobourov, Stephen G.; Erten, Cesim; Kılıç, Yasin Ozan (ASSOC COMPUTING MACHINERY, 2010-09)
    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 ...
  • Colored simultaneous geometric embeddings and universal pointsets 

    Brandes, Ulrik; Erten, Cesim; Estrella-Balderrama, Alejandro; Fowler, J. Joseph; Frati, Fabrizio; Geyer, Markus; Gutwenger, Carsten; Hong, Seok-Hee; Kaufmann, Michael; Kobourov, Stephen G.; Liotta, Giuseppe; Mutzel, Petra; Symvonis, Antonios (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 ...
  • Student conference as a student centred environment for integrating technical writings into computer engineering curriculum 

    Yakhno, Tatyana; Ekin, Emine (ANI YAYINCILIK, 2011)
    Problem Statement: In today's world there are pressures on universities to ensure that graduates have the capacity to meet the needs of employers. One aspect of this is to ensure that students, along with professional ...
  • Algebraic break of image ciphers based on discretized chaotic map lattices 

    Solak, Ercan; Çokal, Cahit (ELSEVIER SCIENCE INC, 2011-01)
    In this paper, we provide an algebraic cryptanalysis of a recently proposed chaotic image cipher. We show that the secret parameters of the algorithm can be revealed using chosen-plaintext attacks. Our attack uses the orbit ...