Search results for "Algorithms"
showing 10 items of 1716 documents
Random forests, a novel approach for discrimination of fish populations using parasites as biological tags.
2008
Due to the complexity of host-parasite relationships, discrimination between fish populations using parasites as biological tags is difficult. This study introduces, to our knowledge for the first time, random forests (RF) as a new modelling technique in the application of parasite community data as biological markers for population assignment of fish. This novel approach is applied to a dataset with a complex structure comprising 763 parasite infracommunities in population samples of Atlantic cod, Gadus morhua, from the spawning/feeding areas in five regions in the North East Atlantic (Baltic, Celtic, Irish and North seas and Icelandic waters). The learning behaviour of RF is evaluated in …
The positioning system of the ANTARES Neutrino Telescope
2012
The ANTARES neutrino telescope, located 40km off the coast of Toulon in the Mediterranean Sea at a mooring depth of about 2475m, consists of twelve detection lines equipped typically with 25 storeys. Every storey carries three optical modules that detect Cherenkov light induced by charged secondary particles (typically muons) coming from neutrino interactions. As these lines are flexible structures fixed to the sea bed and held taut by a buoy, sea currents cause the lines to move and the storeys to rotate. The knowledge of the position of the optical modules with a precision better than 10cm is essential for a good reconstruction of particle tracks. In this paper the ANTARES positioning sys…
Active contour algorithm with discriminant analysis for delineating tumors in positron emission tomography.
2019
Abstract In the context of cancer delineation using positron emission tomography datasets, we present an innovative approach which purpose is to tackle the real-time, three-dimensional segmentation task in a full, or at least nearly full automatized way. The approach comprises a preliminary initialization phase where the user highlights a region of interest around the cancer on just one slice of the tomographic dataset. The algorithm takes care of identifying an optimal and user-independent region of interest around the anomalous tissue and located on the slice containing the highest standardized uptake value so to start the successive segmentation task. The three-dimensional volume is then…
New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
2011
[EN] The min-max windy rural postman problem is a multiple vehicle version of the windy rural postman problem, WRPP, which consists of minimizing the length of the longest route to find a set of balanced routes for the vehicles. In a previous paper, an ILP formulation and a partial polyhedral study were presented, and a preliminary branch-and-cut algorithm that produced some promising computational results was implemented. In this article, we present further results for this problem. We describe several new facet-inducing inequalities obtained from the WRPP, as well as some inequalities that have to be satisfied by any optimal solution. We present an enhanced branch-and-cut algorithm that t…
Next generation diagnostic algorithm in non-small cell lung cancer predictive molecular pathology: The KWAY Italian multicenter cost evaluation study
2022
Abstract Aims The KWAY project aims to investigate the economic sustainability of the up-front NGS technologies adoption in the analysis of clinically relevant molecular alterations in NSCLC patients. Methods The diagnostic workflow and the related sustained costs of five Italian referral centers were assessed in four different evolving scenarios were analyzed. For each scenario, two alternative testing strategies were evaluated: the Maximized Standard strategy and the Maximized NGS strategy. Results For each center, the robustness of obtained results was verified through a deterministic sensitivity analysis, observing the variation of total costs based on a variation of ±20 % of the input …
Centrality in primate-parasite networks reveals the potential for the transmission of emerging infectious diseases to humans
2013
We thank Randi Griffin, Amy Pedersen, Rosa Menendez, Mark Lineham, and two anonymous reviewers for discussion and comments on a previous draft. This work was funded by the Spanish Ministry of Science (J.M.G. and M.V.), by the Junta de Andalucia (J.M.G.), and by National Science Foundation Grants DEB-0211908 and EF-0723939/0904359 (C.L.N.).
A probabilistic rainfall model to estimate the leading-edge lifetime of wind turbine blade coating system
2021
Rain-induced leading-edge erosion of wind turbine blades is associated with high repair and maintenance costs. For efficient operation and maintenance, erosion models are required that provide estimates of blade coating lifetime at a real scale. In this study, a statistical rainfall model is established that describes probabilistic distributions of rain parameters that are critical for site-specific leading-edge erosion assessment. A new droplet size distribution (DSD) is determined based on two years’ onshore rainfall data of an inland site in the Netherlands and the obtained DSD is compared with those from the literature. Joint probability distribution functions of rain intensities and dr…
The linear saturated decentralized strategy for constrained flow control is asymptotically optimal
2013
We present an algorithm for constrained network flow control in the presence of an unknown demand. Our algorithm is decentralized in the sense that it is implemented by a team of agents, each controlling just the flow on a single arc of the network based only on the buffer levels at the nodes at the extremes of the arc, while ignoring the actions of other agents and the network topology. We prove that our algorithm is also stabilizing and steady-state optimal. Specifically, we show that it asymptotically produces the minimum-norm flow. We finally generalize our algorithm to networks with a linear dynamics and we prove that certain least-square optimality properties still hold.
Quantized Dissensus in switching networks with nodes death and duplication* *Research supported by MURST-PRIN “Robust Techniques for uncertain system…
2009
Abstract In this paper we discuss agents exchanging quantized flows to diverge one from the others according to a dissensus protocol. A Quantized Gossip algorithm is considered. Evolutions of the states during switching intervals and at switching instants and their property are described and analyzed. The modeling of switching systems describing networks where death and duplication processes occur is described. Some properties of the topology reached by the network when different rules of duplication and inheritance are implemented.
On Using the Theory of Regular Functions to Prove the ε-Optimality of the Continuous Pursuit Learning Automaton
2013
Published version of a chapter in the book: Recent Trends in Applied Artificial Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-38577-3_27 There are various families of Learning Automata (LA) such as Fixed Structure, Variable Structure, Discretized etc. Informally, if the environment is stationary, their ε-optimality is defined as their ability to converge to the optimal action with an arbitrarily large probability, if the learning parameter is sufficiently small/large. Of these LA families, Estimator Algorithms (EAs) are certainly the fastest, and within this family, the set of Pursuit algorithms have been considered to be the pioneering schemes. The…