this paper focuses upon the development of an efficient method for conceptual design optimization of a satellite. there are many option for a satellite subsystems that could be choice, as acceptable solution to implement of a space system mission. every option should be assessment based on the different criteria such as cost, mass, reliability and technology contraint (complexity). in this rese...

Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identical transmission radius. In compare, this paper addresses the problem of deploying relay nodes to provide fault tolerance with higher network connectivity in heterogeneous wireless sensor networks, where sensor nodes have d...

geological facies interpretation is essential for reservoir studying. the method of classification and identification seismic traces is a powerful approach for geological facies classification and distinction. use of neural networks as classifiers is increasing in different sciences like seismic. they are computer efficient and ideal for patterns identification. they can simply learn new algori...

A natural way to characterize the cluster structure of a dataset is by finding regions containing a high density of data. This can be done in a nonparametric way with a kernel density estimate, whose modes and hence clusters can be found using mean-shift algorithms. We describe the theory and practice behind clustering based on kernel density estimates and mean-shift algorithms. We discuss the ...

This work is devoted to contribute with two algorithms for performing, in an efficient way, connected components labeling and boundary extraction from orthogonal pseudo-polytopes. The proposals are specified in terms of the extreme vertices model in the n-dimensional space nDEVM . An overview of the model is presented, considering aspects such as its fundamentals and basic algorithms. The tempo...

Comparable corpora have been used as an alternative for parallel corpora as resources for computational tasks that involve domainspecific natural language processing. One way to gather documents related to a specific topic of interest is to traverse a portion of the web graph in a targeted way, using focused crawling algorithms. In this paper, we compare several focused crawling algorithms usin...

The development of intelligent control algorithms for robotic assets to be used in coalition operations is impeded by a significant gap between the way the theoretical artificial intelligence (A.I.) algorithms have been traditionally designed and validated and the way the practical algorithms for controlling robotic assets in (simulated) tactical missions are developed. On the first front, synt...

New hybrid conjugate gradient algorithms are proposed and analyzed. In these hybrid algorithms the famous parameter k β is computed as a convex combination of the Polak-Ribière-Polyak and Dai-Yuan conjugate gradient algorithms. In one hybrid algorithm the parameter in convex combination is computed in such a way that the conjugacy condition is satisfied, independent of the line search. In the o...

Distributing spatially located heterogeneous workloads is an important problem in parallel scientific computing. We investigate the problem of partitioning such workloads (represented as a matrix of non-negative integers) into rectangles, such that the load of the most loaded rectangle (processor) is minimized. Since finding the optimal arbitrary rectangle-based partition is an NP-hard problem,...

The automatic configuration of algorithms is a dynamic field of research. Its potential for producing highly performing algorithms may change the way we design algorithms. So far, automatic algorithm configuration tools have almost exclusively been applied to configure singleobjective algorithms. In this paper, we investigate the usage of automatic algorithm configuration tools to improve multi...