Search results for "Algorithm"
showing 10 items of 4887 documents
Different Methods of Artificial Intelligence Used for Optimization the Turning Process
2015
In this paper, we realize a comparative study between some heuristics methods applied in turning operation in order to find optimal cutting parameters. We consider five different constraints aimed to achieve minimum total cost of machining. We have chosen the Simulated Annealing (SA) – a local search method, and Weighted-Sum Genetic Algorithm (WSGA) – a non-Pareto approach of a multi-objective optimization algorithm, based on a weighted aggregation of objectives. The aggregation may be with fixed weights or with random (variable) weights. The simulations showed that, even if it produces better results than the SA, WSGA with fixed weights, does not lead to optimum results, highlighting in th…
Evaluation of the effect of chance correlations on variable selection using Partial Least Squares -Discriminant Analysis
2013
Variable subset selection is often mandatory in high throughput metabolomics and proteomics. However, depending on the variable to sample ratio there is a significant susceptibility of variable selection towards chance correlations. The evaluation of the predictive capabilities of PLSDA models estimated by cross-validation after feature selection provides overly optimistic results if the selection is performed on the entire set and no external validation set is available. In this work, a simulation of the statistical null hypothesis is proposed to test whether the discrimination capability of a PLSDA model after variable selection estimated by cross-validation is statistically higher than t…
Evolutionary selection and variation in family businesses
2011
PurposeThis qualitative study attempts to understand what kinds of evolutionary selection and variation occur in family businesses during the preparation of a managerial and ownership succession.Design/methodology/approachThe study was conducted by interviewing members of one family business in Louisiana, USA and one in Finland in order to contribute to the understanding of succession preparation in small family businesses with two generations. Evolutionary economics was adapted for this interdisciplinary study to explain evolutionary changes in a family business succession.FindingsThe findings indicate that both selection and variation can take place through different routes during the pre…
A comparison of three recent selection theorems
2007
We compare a recent selection theorem given by Chistyakov using the notion of modulus of variation, with the Schrader theorem based on bounded oscillation and with the Di Piazza-Maniscalco theorem based on bounded ${\cal A},\Lambda$-oscillation.
First Retrievals of ASCAT-IB VOD (Vegetation Optical Depth) at Global Scale
2021
Global and long-term vegetation optical depth (VOD) dataset are very useful to monitor the dynamics of the vegetation features, climate and environmental changes. In this study, the radar-based global ASCAT (Advanced SCATterometer) IB (INRAE-BORDEAUX) VOD was retrieved using a model which was recently calibrated over Africa. In order to assess the performance of IB VOD, the Saatchi biomass and three other VOD datasets (ASCAT V16, AMSR2 LPRM V5 and VODCA LPRM V6) derived from C-band observations were used in the comparison. The preliminary results show that IB VOD has a promising ability to predict biomass $(\mathrm{R}=0.74,\ \text{RMSE} =44.82\ \text{Mg}\ \text{ha}^{-1})$ , which is better …
Network Slicing Enabled Resource Management for Service-Oriented Ultra-Reliable and Low-Latency Vehicular Networks
2020
Network slicing has been considered as a promising candidate to provide customized services for vehicular applications that have extremely high requirements of latency and reliability. However, the high mobility of vehicles poses significant challenges to resource management in such a stochastic vehicular environment with time-varying service demands. In this paper, we develop an online network slicing scheduling strategy for joint resource block (RB) allocation and power control in vehicular networks. The long-term time-averaged total system capacity is maximized while guaranteeing strict ultra-reliable and low-latency requirements of vehicle communication links, subject to stability const…
Velocity estimation in wideband mobile stations equipped with multiple antennas
2009
©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Article also available from publisher: http://dx.doi.org/10.1109/VETECS.2009.5073907 A new method is proposed for estimating the velocity of wideband mobile stations (MSs) equipped with multiple antennas. The MS speed is determined using the well-known relationship between the direction-of-arrivals (DOAs) and the Doppler frequency shifts experienced by the mult…
Automatische Klassifikation der Lebersegmente nach Couinaud: Entwicklung eines neuen Algorithmus und Evaluierung an Spiral-CT-Datensätzen
2003
Purpose: To develop a software tool that analyzes the anatomy of the portal vein branches and assigns segmental and subsegmental branches according to Couinaud's classification system and to evaluate its accuracy. Materials and Methods: The algorithm was developed in C++ on a PC. The algorithm recognizes the three major branching patterns of the portal vein. Segmental and subsegmental branches are assigned to 8 segments following Couinaud and encoded by 8 colors. The software was evaluated using CT data sets of 39 patients. After the individual segmental anatomy of each patient was determined by an experienced radiologist, automatic classification was performed and the results were compared…
Compression of binary images based on covering
1995
The paper describes a new technique to compress binary images based on an image covering algorithm. The idea is that binary images can be always covered by rectangles, univocally described by a vertex and two adjacent edges (L-shape). Some optimisations are necessary to consider degenerate configurations. The method has been tested on several images representing drawings and typed texts. The comparison with existing image file compression techniques shows a good performance of our approach. Further optimisations are under development.
Distributed Leader Election and Computation of Local Identifiers for Programmable Matter
2019
International audience; The context of this paper is programmable matter, which consists of a set of computational elements, called particles, in an infinite graph. The considered infinite graphs are the square, triangular and king grids. Each particle occupies one vertex, can communicate with the adjacent particles, has the same clockwise direction and knows the local positions of neighborhood particles. Under these assumptions, we describe a new leader election algorithm affecting a variable to the particles, called the k-local identifier, in such a way that particles at close distance have each a different k-local identifier. For all the presented algorithms, the particles only need a O(…