Ara
Toplam kayıt 11, listelenen: 1-10
A factorized high dimensional model representation on the nodes of a finite hyperprismatic regular grid
(Elsevier Science inc, 2005-05-25)
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
(Elsevier B.V., 2006-01-01)
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
(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
(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 ...
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 ...
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 ...
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 ...
Comment on "Encryption and decryption of images with chaotic map lattices" [Chaos 16, 033118 (2006)]
(American Institute of Physics Inc., 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
(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 ...
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 ...