simulator and a new parallel/distributed program for optimal path discover was developed to be used into the cluster prototype. All tests of the evasion procedures simulator were satisfactory
usefulness of textural parameters within the SVM based classification. An optimization of the independent SVM-based classifiers and a clustering procedure complete the methodology
mobile nodes. we propose construction form of cluster based tree, And rumor protocol used to find the optimal path form of each indival nodes, and also used to mesh topology
corresponding neutral clusters by Density functional theory with the B3LYP exchange-correlation functional using DGDZVP as the basis set. As the first step of calculation, geometrical optimizations of the nanoclusters…
median, average within cluster connection. The nearest neighbor method presented the largest number of genotypes in group I and showed the greatest similarity with the Tocher optimization method. The joint
vibrational frequency of the most stable small AuN clusters with N = 3 to 20 are presented through global structure re-optimization Study. The finite-differentiation method has been implemented within ... wavenumbers at…
compared it with traditional Low Energy Adaptive Clustering Hierarchy (LEACH) and SEP. In addition, that energy can be optimized by scheduling the node to sleep mode and alive mode. Simulation
threshold function is proposed. Using genetic algorithm combined with clustering histogram of the image information are used to get the optimal threshold, the calculation without a priori information, such
limitation of a method already developed for this purpose and gives a more flexible, optimized and best performing method. This method can now be effectively used in the pre-processing ... researchers towards a…
removed from the corresponding neutral clusters by Density functional theory with the B3LYP exchange-correlation functional using DGDZVP as the basis set. Firstly geometrical optimizations of the nanoclusters have been…
propose a solution to the scheduling problem in clustered wireless sensor networks (WSNs). The objective is to provide network-wide optimized time division multiple access (TDMA) schedules that can achieve ... simpler…
Ward’s Algorithm with Honey Bee optimization is done for spatial data mining and finally an algorithm is created for data clustering also. Cluster analysis or clustering is the task
into informationtheoretic co-clustering. The constraints are modeled with two-sided hidden Markov random field (HMRF) regularizations. An alternating Expectation Maximization (EM) algorithm has developed to optimize the…
have found all 4 clusters are having the very same C1 point symmetry group. For the re-optimization process, the finite-differentiation method has been implemented within the Density Functional ... Most significantly…
Furthermore, we have applied the k-Means algorithm optimized with the Elbow method and we found the presence of four clusters in the sense of GDPG rate. Finally, we confront
cover”. Furthermore, we apply the k-Means algorithm optimized with the Silhouette Coefficient and we find the presence of two clusters. Finally, we confront eight different machine-learning algorithms
collected by the sensors are gathered through the cluster heads are adopted . A Mixed Integer Linear Programming (MILP) model to optimally determine the sink and CH locations as well
Proofs of concept have shown that chromosomal gene clusters encoding ribosomal RNA (rRNA) constitute gene delivery integration loci that are optimal for transgene expression. However, because homologous recombination is…
neoclusterization. The concept of an innovation cluster and its corresponding methodological tools are proposed as a theoretical and methodological basis for optimizing innovation processes in the context of spatial…
magnetic cluster was analyzed by X-ray absorption fine structure (XAFS). DC and AC magnetization measurements were performed using SQUID magnetometer. Composition and particle size were optimized
this paper a super pixel segmentation algorithm called Linear Spectral Clustering (LSC), which produces compact and uniform super pixels with low computational costs. Basically, a normalized cuts formulation ... optimum…
Kernel Principal Component Analysis (KPCA) parameter optimization, optimal polynomial kernel to delete data information, and ant colony genetic algorithm (association) clustering analysis of data dimensionality…
kernel principal component analysis (KPCA) parameter optimization, optimal polynomial kernel to delete data information, and ant colony genetic algorithm (association) clustering analysis of data dimensionality…
phosphorus, potassium, and zinc in grains. In cluster analyses, six groups by principal components and 33 groups by the Tocher optimization method were identified. These methods partially agreed
For authors and organisers
Publish, present and keep up with your field
Find the right journal for your paper and submit your manuscript.