Search results for "algorithm"
showing 10 items of 4887 documents
Editing prototypes in the finite sample size case using alternative neighborhoods
1998
The recently introduced concept of Nearest Centroid Neighborhood is applied to discard outliers and prototypes 111 class overlapping regions in order to improve the performance of the Nearest Neighbor rule through an editing procedure, This approach is related to graph based editing algorithms which also define alternative neighborhoods in terms of geornetric relations, Classical editing algorithms are compared to these alternative editing schemes using several synthetic and real data problems. The empirical results show that, the proposed editing algorithm constitutes a good trade-off among performance and computational burden.
Design optimization of mooring system: An application to a vessel-shaped offshore fish farm
2019
Abstract Design optimization of mooring systems of offshore floating structures is a challenging task, partly because of the large number of design variables, complicated design constraints, nonlinear system behavior, and time-consuming numerical simulations. For engineering designs, efficient yet accurate approaches are needed. This paper proposes an integrated optimization methodology for design of mooring systems. The methodology integrates the design of experiments, screening analysis, time-domain simulations, and a metamodel-based optimization procedure. To demonstrate the methodology, the mooring system of a vessel-shaped offshore fish farm was designed considering the ultimate limit …
A Comparison of Algorithms for Path Planning of Industrial Robots
2008
In this paper, the path planning problem for industrial robots in environ- ments with obstacles has been solved using four algorithms that implement different methodologies. Our objective is to analyze the characteristics of these algorithms. Consequently, the results (solutions) obtained with each of them are compared through the analysis of three operational parameters that are relevant to determine the qualities of the solutions. These parameters are: the computational time, the distance travelled by the robot and the number of generated configurations. One of the algorithms can be catalogued as indirect and the other three are variations of a direct method. The four algorithms have been…
Efficient cluster-based routing algorithm for body sensor networks
2018
International audience; Body Sensor Networks have gained a lot of research interest lately for the variety of applications they can serve. In such networks where nodes might hold critical information about people's lives, designing efficient routing schemes is very important to guarantee data delivery with the lowest delay and energy consumption. Even though some cluster-based routing schemes were proposed in the literature, none of them offer a complete solution that guarantees energy and delay efficient routing in BSN. In this paper, we propose a robust cluster- based algorithm that increases the routing efficiency through every step of the routing process: cluster formation, cluster head…
Numerical implementation of active power flow tracing methods: Practical implications on transmission networks and DR programs support
2015
The goal of this paper is to demonstrate the powerful contribution of the electric active power flow tracing methods on studying the electric transmission systems operating conditions. The tracing methods allow to impute to every generation unit and/or load the responsibility of the power flows of all the elements connected to the network. This study propose the numerical implementation of two different tracing methods on two transmission networks through Matlab® scripts developed on purpose; then the analysis is focused on identifying the loads which mostly affect the power line flows of the system. The results of this analysis point out the loads on which the application of the Demand Res…
Least-squares community extraction in feature-rich networks using similarity data
2021
We explore a doubly-greedy approach to the issue of community detection in feature-rich networks. According to this approach, both the network and feature data are straightforwardly recovered from the underlying unknown non-overlapping communities, supplied with a center in the feature space and intensity weight(s) over the network each. Our least-squares additive criterion allows us to search for communities one-by-one and to find each community by adding entities one by one. A focus of this paper is that the feature-space data part is converted into a similarity matrix format. The similarity/link values can be used in either of two modes: (a) as measured in the same scale so that one may …
Are nonlinear model-free conditional entropy approaches for the assessment of cardiac control complexity superior to the linear model-based one?
2016
Objective : We test the hypothesis that the linear model-based (MB) approach for the estimation of conditional entropy (CE) can be utilized to assess the complexity of the cardiac control in healthy individuals. Methods : An MB estimate of CE was tested in an experimental protocol (i.e., the graded head-up tilt) known to produce a gradual decrease of cardiac control complexity as a result of the progressive vagal withdrawal and concomitant sympathetic activation. The MB approach was compared with traditionally exploited nonlinear model-free (MF) techniques such as corrected approximate entropy, sample entropy, corrected CE, two k -nearest-neighbor CE procedures and permutation CE. Electroca…
Characterization of entropy measures against data loss: Application to EEG records
2012
This study is aimed at characterizing three signal entropy measures, Approximate Entropy (ApEn), Sample Entropy (SampEn) and Multiscale Entropy (MSE) over real EEG signals when a number of samples are randomly lost due to, for example, wireless data transmission. The experimental EEG database comprises two main signal groups: control EEGs and epileptic EEGs. Results show that both SampEn and ApEn enable a clear distinction between control and epileptic signals, but SampEn shows a more robust performance over a wide range of sample loss ratios. MSE exhibits a poor behavior for ratios over a 40% of sample loss. The EEG non-stationary and random trends are kept even when a great number of samp…
A Bayesian unified framework for risk estimation and cluster identification in small area health data analysis.
2020
Many statistical models have been proposed to analyse small area disease data with the aim of describing spatial variation in disease risk. In this paper, we propose a Bayesian hierarchical model that simultaneously allows for risk estimation and cluster identification. Our model formulation assumes that there is an unknown number of risk classes and small areas are assigned to a risk class by means of independent allocation variables. Therefore, areas within each cluster are assumed to share a common risk but they may be geographically separated. The posterior distribution of the parameter representing the number of risk classes is estimated using a novel procedure that combines its prior …
Detection, tracking and event localization of jet stream features in 4-D atmospheric data
2012
We introduce a novel algorithm for the efficient detection and tracking of features in spatiotemporal atmospheric data, as well as for the precise localization of the occurring genesis, lysis, merging and splitting events. The algorithm works on data given on a four-dimensional structured grid. Feature selection and clustering are based on adjustable local and global criteria, feature tracking is predominantly based on spatial overlaps of the feature's full volumes. The resulting 3-D features and the identified correspondences between features of consecutive time steps are represented as the nodes and edges of a directed acyclic graph, the event graph. Merging and splitting events appear in…